Tássio Naia

activity

20162026

most citedSeparating the edges of a graph by a linear number of paths

9 citations · 9 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

11 papers · 1 filter

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

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.CO2025

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.CO2024

Packing large balanced trees into bipartite graphs

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

We prove that for every $γ > 0$ there exists $n_{0} \in N$ such that for every $n \geq n_{0}$ any family of up to $⌊ n^{\frac{1}{2} + γ} ⌋$ 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…

math.CO2023★ 9 cited

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

Marthe Bonamy, Fábio Botler, François Dross +2

Recently, Letzter proved that any graph of order $n$ contains a collection $P$ of $O (n lo g^{⋆} n)$ paths with the following property: for all distinct edges $e$ and $f$ …

math.CO2022

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

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

Seymour's Second Neighborhood Conjecture (SNC) states that every oriented graph contains a vertex whose second neighborhood is as large as its first neighborhood. We investigate th…

math.CO2022

Directed graphs with lower orientation Ramsey thresholds

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa +2

We investigate the threshold $p_{H} = p_{H} (n)$ for the Ramsey-type property $G (n, p) \to H$ , where $G (n, p)$ is the binomial random graph and $G \to H$ indicates that…

math.CO2020

Orientation Ramsey thresholds for cycles and cliques

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa +1

If $G$ is a graph and $H$ is an oriented graph, we write $G \to H$ to say that every orientation of the edges of $G$ contains $H$ as a subdigraph. We consider the cas…

math.CO2020

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.CO2016

Unavoidable trees in tournaments