Tássio Naia

From MaRDI portal
Person:2132399



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Rainbow trapezoids with given area
(available as arXiv preprint)
2026-01-01Paper
On converse invariant trees of diameter four
(available as arXiv preprint)
2026-01-01Paper
Packing large balanced trees into bipartite graphs
Discrete Mathematics
2025-09-04Paper
Separating the edges of a graph by cycles and by subdivisions of K₄
Journal of Graph Theory
2025-08-07Paper
Seymour's second neighborhood conjecture in arbitrary orientations of a random graph2025-08-01Paper
Separating the edges of a graph by a linear number of paths
Advances in Combinatorics
2025-04-29Paper
Directed graphs with lower orientation Ramsey thresholds
RAIRO. Operations Research
2025-01-08Paper
Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
(available as arXiv preprint)
2025-01-01Paper
Separating the edges of a graph by cycles and by subdivisions of K₄
(available as arXiv preprint)
2024-01-01Paper
Packing large balanced trees into bipartite graphs
(available as arXiv preprint)
2024-01-01Paper
Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs
Discrete Mathematics
2023-10-04Paper
Separating the edges of a graph by a linear number of paths2023-01-20Paper
Directed graphs with lower orientation Ramsey thresholds2022-11-13Paper
Trees contained in every orientation of a graph
The Electronic Journal of Combinatorics
2022-05-12Paper
Spanning trees of dense directed graphs2022-04-27Paper
Orientation Ramsey thresholds for cycles and cliques
SIAM Journal on Discrete Mathematics
2021-12-01Paper
Trees and tree-like structures in dense digraphs2020-12-16Paper
Trees and tree-like structures in dense digraphs
(available as arXiv preprint)
2020-01-01Paper
Unavoidable trees in tournaments
Random Structures & Algorithms
2018-09-25Paper
Unavoidable trees in tournaments
Random Structures & Algorithms
2018-09-25Paper


Research outcomes over time


This page was built for person: Tássio Naia