Tássio Naia

According to our database, Tássio Naia authored at least 10 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Separating the Edges of a Graph by Cycles and by Subdivisions of K4.

Fábio Botler, Tássio Naia

J. Graph Theory, 2025

Packing large balanced trees into bipartite graphs.

Cristina G. Fernandes, Tássio Naia, Giovanne Santos, Maya Stein

Discret. Math., 2025

2024

Directed graphs with lower orientation Ramsey thresholds.

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Tássio Naia

RAIRO Oper. Res., 2024

Separating the edges of a graph by cycles and by subdivisions of K₄.

Fábio Botler, Tássio Naia

CoRR, 2024

2023

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs.

Fábio Botler, Phablo F. S. Moura, Tássio Naia

Discret. Math., December, 2023

Separating the edges of a graph by a linear number of paths.

Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan

CoRR, 2023

2022

Trees Contained in Every Orientation of a Graph.

Tássio Naia

Electron. J. Comb., 2022

2021

Orientation Ramsey Thresholds for Cycles and Cliques.

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Tássio Naia

SIAM J. Discret. Math., 2021

2019

Spanning Trees of Dense Directed Graphs.

Richard Mycroft, Tássio Naia

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Unavoidable trees in tournaments.

Richard Mycroft, Tássio Naia

Random Struct. Algorithms, 2018