Tássio Naia

collaborators

7 papers

math.CO2026

Graph factors and powers of Hamilton cycles in the budget-constrained random graph process

Alberto Espuny DÃaz, Frederik Garbe, TÃ¡ssio Naia +1

We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with $t$ distinct edges of…

math.CO2026

On converse invariant trees of diameter four

Fernando Afonso, Lucas Colucci, TÃ¡ssio Naia

Let $D$ be an oriented graph, and let $f_{T} (D)$ denote the number of copies of $D$ in a tournament $T$ . We say that $D$ is \emph{converse invariant} if $f_{T} (D) = f_{T} (D)$ for…

math.CO2026

Trees and treelike structures in dense digraphs

Richard Mycroft, TÃ¡ssio Naia

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at le…

math.CO2026

Rainbow trapezoids with given area

Sukumar Das Adhikari, TÃ¡ssio Naia, Oriol Serra

A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$ , every coloring of the plane with finite number of colors contains a monoch…

math.CO2024

Packing large balanced trees into bipartite graphs

Cristina G. Fernandes, TÃ¡ssio Naia, Giovanne Santos +1

We prove that for every $I^^{3} > 0$ there exists $n_{0} \in N$ such that for every $n \geq n_{0}$ any family of up to $⌊ n^{\frac{1}{2} + I^^{3}} ⌋$ trees having at most $(1…

math.CO2024

Separating the edges of a graph by cycles and by subdivisions of $K_{4}$

FÃ¡bio Botler, TÃ¡ssio Naia

A separating system of a graph $G$ is a family $S$ of subgraphs of $G$ for which the following holds: for all distinct edges $e$ and $f$ of $G$ , there exists an element i…

Graph factors and powers of Hamilton cycles in the budget-constrained random graph process

On converse invariant trees of diameter four

Trees and treelike structures in dense digraphs

Rainbow trapezoids with given area

Packing large balanced trees into bipartite graphs

Separating the edges of a graph by cycles and by subdivisions of K4​

Separating the edges of a graph by cycles and by subdivisions of $K_{4}$