A 5-vertex tournament, with an unavoidable tree highlighted in it.

Tássio Naia ['ta.sio 'naj.ɐ]T\'assio

PhD — University of Birmingham, 2018.

Hello!

I am a María de Maeztu fellow at the Centre de Reserca Matemática,
working with Perarnau, Guillem and the GAPCOMB-UPC group.

Previously, I was a postdoc at LaBRI-U. Bordeaux and IME-USP,
working with Marthe Bonamy and Yoshiharu Kohayakawa.

I received my PhD from the University of Birmingham, in 2018,
where my supervisors were Richard Mycroft and Deryk Osthus.

I currently supervise Hugo Vicente (MSc, since 2024, co-supervised by Guilherme Mota).

I am interested in Combinatorics, Probability and Algorithms.

📚 Journal publications, theses & preprints

Packing large balanced trees into bipartite graphs
C.G. Fernandes, T. Naia, G. Santos, M. Stein.
Submitted.
Separating the edges of a graph by cycles and by subdivisions of K₄
F. Botler, T. Naia.
Submitted.
Trees and tree-like structures in dense digraphs
R. Mycroft, T. Naia.
Combinatorics, Probability and Computing, to appear.
Directed graphs with lower orientation Ramsey thresholds
G.F. Barros, B.P. Cavalar, Y. Kohayakawa, G.O. Mota, T. Naia.
Rairo-OP, to appear [doi:10.1051/ro/2024090].
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, October 2023 [DOI:10.19086/aic.2023.6].
Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs
F. Botler, P.F. Moura, T. Naia.
Discrete Mathematics, 346(12) (2023), 113583 [DOI:10.1016/j.disc.2023.113583].
Trees Contained in Every Orientation of a Graph.
T. Naia.
Electronic Journal of Combinatorics, 29-2 (2022), P2.26.
Orientation Ramsey thresholds for cycles and cliques
G.F. Barros, B.P. Cavalar, Y. Kohayakawa, T. Naia.
SIAM Journal on Discrete Mathematics, 35(4) (2021) 2844–2857.
Unavoidable trees in tournaments
R. Mycroft, T. Naia.
Random Structures & Algorithms, 53 (2018) 352–385.

Large structures in dense directed graphs.
PhD thesis, University of Birmingham, Birmingham, UK, 2018.
Grafos aleatórios exponenciais.
MSc thesis, Universidade de São Paulo, São Paulo, Brazil, 2013.

Extended abstracts

Cobertura de grafos aleatórios por caminhos multicoloridos A. Kaique, G.O. Mota, T. Naia.
Anais do VIII Encontro de Teoria da Computação (ETC 2023).
Seymour’s Second Neighborhood Conjecture on sparse random graphs
F. Botler, P.F. Moura, T. Naia.
Anais do VII Encontro de Teoria da Computação (ETC 2022).
Seymour’s Second Neighborhood Conjecture in Arbitrary Orientations of a Random Graph
F. Botler, P.F. Moura, T. Naia.
Discrete Mathematics Days 2022, 263 (2022) 58–62.
Oriented Graphs with Lower Orientation Ramsey Thresholds
G.F. Barros, B.P. Cavalar, Y. Kohayakawa G.O. Mota, T. Naia.
Trends in Mathematics 14. Extended Abstracts EuroComb 2021, (2021), 799–804.
Spanning trees of dense directed graphs
R. Mycroft, T. Naia.
Electronic Notes in Theoretical Computer Science 346 (2019). Proceedings of X Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), 645–654.

Coauthors

Barros, Gabriel Ferreira	Kaique, Antônio	Pasqualotto Cavalar, Bruno
Bonamy, Marthe	Kohayakawa, Yoshiharu	Santos, Giovanne
Botler, Fábio	Mota, Guilherme Oliveira	Skokan, Jozef
Dross, François	Moura, Phablo F.S.	Stein, Maya
Fernandes, Cristina	Mycroft, Richard

Soon-to-be coauthors (works in preparation)

Espuny Díaz, Alberto	Mendonça, Walner	Serra, Oriol
Garbe, Frederik	Morris, Patrick	Smith, Zak
Hàn, Hiệp	Pavez-Signé	Trujillo, Anna L.
Lichev, Lyuben	Perarnau, Guillem	Ortega, Miquel

Research visits

Richard Mycroft (University of Birmingham, United Kingdom),
Guillem Perarnau (Universitat Politècnica de Catalunya, Spain),
Carlos Hoppen (Universidade Federal do Rio Grande do Sul, Brazil),
Fábio Botler (Universidade Federal do Rio de Janeiro, Brazil),
Alberto Espuny Díaz (Universität Heidelberg, Germany).

🗨 Talks, workshops, conferences

VII Congreso de Jóvenes Investigadores de la RSME 13–17 Jan 2025
Interplays between Algebra, Combinatorics and proof formalization CRM, Belaterra, Spain, 15 July 2024
Discrete Mathematics Days Alcalá de Henares, 3–5 Jul, 2024
5th GAPCOMB Montserrat, Catalunya, Spain, 9–12 Jul 2024.
Barcelona Graduate School of Math / Berlin Mathematical School Junior Meeting Berlin, Germany, 26–28 June, 2024.
Combinatorics Workshop Laskowa, Poland, 18–26 May, 2024.
Combinatorics Seminar Heidelberg, Germany, 29 February, 2024.
Discrete Probability Days CRM, Bellaterra, Spain, 16–20 Oct, 2023.
Minicourse on Geometric Random Graph Models CRM, Bellaterra, Spain, 10–11 Oct, 2023.
4th GAPCOMB Montserrat, Catalunya, Spain, Jul 11–14, 2023.
CanaDAM 2023 University of Manitoba and University of Winnipeg, Winnipeg, Canada. Jun 5–8, 2023.
TCCO Seminar, São Paulo, Brazil, 16 Jun, 2023.
Seminário de Algoritmos e Combinatória, Universidade Federal do Rio de Janeiro, Brazil, May 10, 2023.
Seminário de Matemática Discreta, Universidade Federal do Rio Grande do Sul, Brazil, Mar 23, 2023.
4° ChiPaGra workshop Instituto de Sistemas Complejos de Valparaíso, Valparaíso, Chile. Mar 06 to 11, 2023.
JGA2022 Paris, France, 16–18 Nov 2022.
LIMDA seminar Universitat Politècnica de Catalunya (UPC), Barcelona, Spain, October 7, 2022.
Discrete Maths Days, U. Cantabria, Santander, Spain, Jul 4–6, 2022.
LAGOS 2021 Online, May 17‐21, 2021.
1° ChiPaGra workshop Online, May 10 and 12, 2021.
Combinatorics Research Seminar, Freie U., Berlin, Germany (online), Jul 15, 2021.
British Combinatorics Meeting 2021, Durham, UK (online), Jul 5–9, 2021.
Seminario de grafos Centro de Modelamento Matemático (CMM) U. Chile, online, Apr 26, 2021.
e-PCC seminar series online, Apr 21, 2021.
XVI Escuela de Verano en Matemáticas Discretas online, Jan 18–23, 2021.
LATIN 2020, São Paulo, Brazil, ~~25–29 May 2020~~ (online). 5–8 Jan 2021.
WoPOCA, online, 3, 6–8 Nov 2020.
WoPOCA, Naza