Folgen
Tássio Naia
Tássio Naia
PhD, University of Birmingham
Bestätigte E-Mail-Adresse bei member.fsf.org - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Unavoidable trees in tournaments
R Mycroft, T Naia
Random Structures & Algorithms 53 (2), 352-385, 2018
112018
Large structures in dense directed graphs
T Naia dos Santos
University of Birmingham, 2018
82018
Separating the edges of a graph by a linear number of paths
M Bonamy, F Botler, F Dross, T Naia, J Skokan
ADVANCES IN COMBINATORICS 6, 7, 2023
7*2023
Spanning trees of dense directed graphs
R Mycroft, T Naia
Electronic Notes in Theoretical Computer Science 346, 645-654, 2019
62019
Trees contained in every orientation of a graph
T Naia
the electronic journal of combinatorics, P2. 26-P2. 26, 2022
22022
Seymour's Second Neighborhood Conjecture for orientations of (pseudo) random graphs
F Botler, PFS Moura, T Naia
Discrete Mathematics 346 (12), 113583, 2023
12023
Orientation Ramsey thresholds for cycles and cliques
GF Barros, BP Cavalar, Y Kohayakawa, T Naia
SIAM Journal on Discrete Mathematics 35 (4), 2844-2857, 2021
12021
Oriented graphs with lower orientation Ramsey thresholds
GF Barros, BP Cavalar, Y Kohayakawa, GO Mota, T Naia
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
2021
Variantes da Torre de Hanói
TN dos Santos, JAR Soares
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–9