Articles

42) , ,
Graphs with asymmetric Ramsey properties
In Submitted, 2026.
41) , , , ,
A sparse canonical van der Waerden theorem
In Submitted, 2026.
40) , , , ,
Separating path systems for cubic graphs and for complete bipartite graphs
In Discrete Mathematics - to appear, 2026.
39) , , ,
A canonical Ramsey theorem for even cycles in random graphs
In Combinatorics, Probability and Computing - to appear, 2026.
38) , , ,
A canonical Ramsey theorem with list constraints in random graphs
In Electronic Journal of Combinatorics, v. 33 (1), P1.41, 2026.
37) , ,
Separating path systems in complete graphs
In Random Structures & Algorithms, v. 66 (3), e70006, 2025.
36) , ,
Counting graph orientations with no directed triangles
In Electronic Journal of Combinatorics, v. 32 (3) P3.2, 2025.
35) , , , ,
Resilience for loose Hamilton cycles
In Accepted for publication - Forum of Mathematics Sigma, 2025.
34) , ,
Counting orientations of random graphs with no directed k-cycles
In Random Structures & Algorithms, v. 64 (3), 676-691, 2024.
33) , , , ,
Directed graphs with lower orientation Ramsey thresholds
In RAIRO, v. 8 (4), 3607-3619, 2024.
32) , , , , ,
On the anti-Ramsey threshold for non-balanced graphs
In Electronic Journal of Combinatorics, v. 31 (1), P1.70, 2024.
31) , , ,
Anti-Ramsey threshold of complete graphs
In Discrete Mathematics, v. 346 (5), 2023.
30) , ,
Counting orientations of graphs with no strongly connected tournaments
In Discrete Mathematics, v. 345 (12), 2022.
29) , , ,
Anti-Ramsey threshold of cycles
In Discrete Applied Mathematics, v. 323 (31), 228-235, 2022.
28) , , , ,
Factors in randomly perturbed k-graphs
In Random Structures & Algorithms, v. 60 (2), 153-165, 2022.
27) , , ,
Constrained colourings of random graphs
In Procedia Computer Science, v. 195, 368-375, 2021.
26) , , ,
Covering 3-coloured random graphs with monochromatic trees
In SIAM Journal on Discrete Mathematics, v. 35 (2), 1447-1459, 2021.
25) , , , ,
The size-Ramsey number of 3-uniform tight paths
In Advances in Combinatorics, 2021:5, 2021.
24) , ,
Locally irregular decomposition of split graphs
In Discrete Applied Mathematics, v. 292, p. 33-44, 2021.
23) , , , , , ,
The size-Ramsey number of powers of bounded degree trees
In Journal of the London Mathematical Society, v. 103, Issue 4, p.1314-1332, 2020.
22) , , , ,
The multicolour size-Ramsey number of powers of paths
In Journal of Combinatorial Theory, Series B, v. 145, p. 359-375, 2020.
21) , , ,
Counting restricted orientations of random graphs
In Random Structures & Algorithms, v. 56, p. 1016-1030, 2020.
20) , , ,
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
In Random Structures & Algorithms, v. 55, Issue 4, p. 795-807, 2019.
19) , , ,
Counting Gallai 3-colorings of complete graphs
In Discrete Mathematics, v. 342, p. 2618-2631, 2019.
18) , , , , , ,
The size-Ramsey number of powers of paths
In Journal of Graph Theory, v. 91, Issue 3, p. 290-299, 2019.
17)
Three-colour bipartite Ramsey number for graphs with small bandwidth
In SIAM Journal on Discrete Mathematics, v. 31, Issue 1, p. 197-208, 2019.
16) , , ,
On the local density problem for graphs of given odd-girth
In Journal of Graph Theory, v. 90, Issue 2, p. 137-149, 2019.
15) , ,
Monochromatic trees in random graphs
In Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, p. 191-208, 2019.
14) , , , ,
Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version
In Contributions to Discrete Mathematics, v. 2, p. 88-100, 2019.
13) , , ,
Counting sparse k-edge-connected hypergraphs with given number of vertices and edges
In Electronic Notes in Theoretical Computer Science: (LAGOS 2019), v. 346, p. 535–544, 2019.
12) , , ,
Decomposing highly connected graphs into paths of length five
In Discrete Applied Mathematics, v. 245, p. 128-138, 2018.
11) , , ,
Decomposing regular graphs with prescribed girth into paths of any given length
In European Journal of Combinatorics, v. 66, p. 28-36, 2017.
10) , , , ,
Loose Hamiltonian cycles forced by large (k-2)-degree - approximation version
In SIAM Journal on Discrete Mathematics (SIDMA), v. 31, p. 2328-2347, 2017.
9) , ,
On an anti-Ramsey threshold for sparse graphs with one triangle
In Journal of Graph Theory, v. 87, p. 176-187, 2017.
8) , , ,
Counting results for sparse pseudorandom hypergraphs I
In European Journal of Combinatorics, v. 65, p. 276-287, 2017.
7) , , ,
Counting results for sparse pseudorandom hypergraphs II
In European Journal of Combinatorics, v. 65, p. 288-301, 2017.
6) , , ,
Decomposing highly connected graphs into paths of any given length
In Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2016.
5) , ,
Decompositions of triangle-free 5-regular graphs into paths of length five
In Discrete Mathematics, Vol. 338, Issue 11, p. 1845-1855, 2015.
4) , , ,
Ramsey numbers for bipartite graphs with small bandwidth
In European Journal of Combinatorics, Vol. 48, p. 165-176, 2015.
3) , , , , ,
Network-based disease gene prioritization by hitting time analysis
In Proceedings of the 2014 IEEE International Conference on Bioinformatics and Bioengineering, p. 9-14, 2014.
2) , , ,
On the number of orientations of random graphs with no directed cycles of a given length
In Electronic Journal of Combinatorics, Vol. 21, Issue 1, 2014.
1) , ,
On an anti-Ramsey threshold for random graphs
In European Journal of Combinatorics, Vol. 40, p. 26-41, 2014.

Extended abstracts

33) , ,
Graphs with asymmetric Ramsey properties.
In Accepted to LAGOS 2025, 2025.
32) , , , ,
Separating path systems for 2-degenerate graphs.
In Accepted to EUROCOMB 2025, 2025.
31) , , , ,
Rainbow path covers of sparse random graphs.
In Accepted to EUROCOMB 2025, 2025.
30) , , ,
An improvement on the K2-irregular index of bipartite graphs.
In Accepted to EUROCOMB 2025, 2025.
29) , , , ,
A canonical van der Waerden theorem in random sets.
In Manuscript, 2025.
28) , , ,
A canonical Ramsey theorem with list constraints in random graphs.
In Submitted, 2025.
27) , , , , ,
Proper edge colorings of complete graphs without repeated triangles.
In Anais do VII Encontro de Teoria da Computação, p. 65–68, 2022.
26) , , , ,
Oriented graphs with lower orientation Ramsey thresholds.
In Proceedings of EUROCOMB 2021, 2021.
25) , ,
Counting C_k-free orientations of G(n,p).
In Proceedings of EUROCOMB 2021, 2021.
24) , , ,
Constrained colourings of random graphs.
In Proceedings of LAGOS 2021, 2021.
23) , , ,
Árvores Ramsey-restritas mínimas.
In Proceedings of ETC 2021, ISSN 2595-6116, p.46--49, 2021.
22) , , ,
Covering 3-coloured random graphs with monochromatic trees.
In Acta Math. Univ. Comenianae: Proceedings of EUROCOMB'19, v. 88, p. 871-875, 2019.
21) , , , , , ,
The size-Ramsey number of powers of bounded degree trees.
In Acta Math. Univ. Comenianae: Proceedings of EUROCOMB'19, v. 88, p. 451-456, 2019.
20) , , ,
Anti-Ramsey threshold of cycles for sparse graphs.
In Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 89-98, 2019.
19) , , ,
Counting sparse k-edge-connected hypergraphs with given number of vertices and edges.
In Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 535-544, 2019.
18) , , , , ,
On edge-magic labelling of forests.
In Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 299-307, 2019.
17) , ,
Locally irregular decomposition of split graphs.
In Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 603-612, 2019.
16) , , ,
On the local density problem for graphs of given odd-girth.
In Proceedings of LAGOS'17. Electronic Notes in Discrete Mathematics, Vol 62, p. 39-44, 2017.
15) , , , ,
Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version.
In Proceedings of EUROCOMB'17. Electronic Notes in Discrete Mathematics, Vol 61, p. 101-106, 2017.
14) , ,
Monochromatic trees in random graphs.
In Proceedings of EUROCOMB'17. Electronic Notes in Discrete Mathematics, Vol 61, p. 759-764, 2017.
13) , , ,
On the number of r-transitive orientations of random graphs.
In Proceedings of EUROCOMB'17. Electronic Notes in Discrete Mathematics, Vol 61, p. 255-261, 2017.
12)
Advances in Anti-Ramsey Theory for sparse graphs.
In Proceedings of the II ETC - CSBC - Encontro de Teoria da Computação, p. 39-42, 2017.
11) , , , , , ,
O número de tamanho-Ramsey para potências de caminhos.
In Proceedings of the II ETC - CSBC - Encontro de Teoria da Computação, p. 31-34, 2017.
10) , , , ,
Loose Hamiltonian cycles forced by large (k-2)-degree - approximation version.
In Proceedings of the Tenth Jornadas de Matematica Discreta y Algoritmica (JMDA), 2016.
9) , , ,
A counting lemma for sparse pseudorandom hypergraphs.
In Proceedings of LAGOS'15. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421-426, 2015.
8) , , ,
Decompositions of highly connected graphs into paths of length five.
In Proceedings of LAGOS'15. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421-426, 2015.
7) , , ,
Decompositions of highly connected graphs into paths of any given length.
In Proceedings of EUROCOMB'15. Electronic Notes in Discrete Mathematics, Vol 49C, p. 795-802, 2015.
6) , , ,
Path decompositions of regular graphs with prescribed girth.
In Proceedings of EUROCOMB'15. Electronic Notes in Discrete Mathematics, Vol 49C, p. 629-636, 2015.
5) , ,
On an anti-Ramsey threshold for sparse graphs with one triangle.
In ICGT 2014, 2014.
4) , ,
Path decompositions of triangle-free 5-regular graphs.
In ICGT 2014, 2014.
3) , , ,
Ramsey numbers for bipartite graphs with small bandwidth.
In Proceedings of Eurocomb 2013. European Journal on Combinatorics, Vol 16, p. 165-170, 2013.
2) , ,
A note on counting orientations.
In Proceedings of LAGOS'11. Electronic Notes in Discrete Mathematics, Vol 37, 2011.
1) , ,
On an anti-Ramsey property of random graphs.
In Proceedings of LAGOS'11. Electronic Notes in Discrete Mathematics, Vol 37, 2011.

Theses

* Master's Degree: Uma generalização do Teorema de Hall e suas implicações para a Teoria de Fatores (in portuguese), UFC, Fortaleza, CE, Brazil, 2009.

* Phd Thesis: Dois resultados em combinatória contemporânea (in portuguese), USP, São Paulo, SP, Brazil, 2013.