List of all coauthors of the papers below: list of coauthors
Articles
2020-2025
46. A step towards the Sparse Half Conjecture for blow-ups of Vega graphs
Manuscript (C. Bispo, G. O. Mota and W. Mendonça)
45. Ramsey constructions supporting the Diagonal Conjecture
Manuscript (W. Mendonça, M. Miralaei and G. O. Mota)
44. Separating path systems for 2-degenerate graphs
Manuscript (C. Fernandes, C. Hoppen, G. Kontogeorgiou, G. O. Mota, and D. Peng)
43. Rainbow path covers of sparse random graphs
Manuscript (F. Botler, A. Kaique, W. Mendonça, G. O. Mota and C. Sato)
42. An improvement on the K2-irregular index of bipartite graphs
Manuscript (P. S. M. Arraes, C. N. Lintzmayer, G. O. Mota, and M. Sambinelli)
41. A canonical van der Waerden theorem in random sets
Manuscript (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota, and M. Ortega)
40. A canonical Ramsey theorem for even cycles in random graphs
Submitted (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota)
arXiv:2411.14566
39. A canonical Ramsey theorem with list constraints in random graphs
Submitted (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota)
arXiv:2304.01846
38. Separating path systems in complete graphs
Random Structures & Algorithms, v. 66 (3), e70006, 2025
(C. G. Fernandes, N. Sanhueza-Matamala, G. O. Mota)
arXiv:2312.14879
37. Counting graph orientations with no directed triangles
Accepted for publication - Electronic Journal of Combinatorics, 2025
(P. Araújo, F. Botler, G. O. Mota)
arXiv:2005.13091
36. Resilience for loose Hamilton cycles
Accepted for publication - Forum of Mathematics Sigma, 2025
(J. D. Alvarado, Y. Kohayakawa, R. Lang, G. O. Mota, H. Stagni)
arXiv:2309.14197
35. Counting orientations of random graphs with no directed k-cycles
Random Structures & Algorithms, v. 64 (3), 676-691, 2024
(M. Campos, M. Collares, G. O. Mota)
arXiv:2209.03339
34. Directed graphs with lower orientation Ramsey thresholds
RAIRO, v. 8 (4), 3607-3619, 2024
(G. F. Barros, B. P. Cavalar, Y. Kohayakawa, G. O. Mota, T. Naia)
arXiv:2211.07033
33. On the anti-Ramsey threshold for non-balanced graphs
Electronic Journal of Combinatorics, v. 31 (1), P1.70, 2024
(P. Araújo, T. Martins, L. Mattos, W. Mendonça, L. Moreira, G. O. Mota)
arXiv:2201.05106
32. Anti-Ramsey threshold of complete graphs
Discrete Mathematics, v. 346 (5), 2023
(Y. Kohayakawa, G. O. Mota, J. Schnitzer, O. Parczyk)
arXiv:1902.00306
31. Counting orientations of graphs with no strongly connected tournaments
Discrete Mathematics, v. 345 (12), 2022
(F. Botler, C. Hoppen, G. O. Mota)
arXiv:2101.12327
30. Anti-Ramsey threshold of cycles
Discrete Applied Mathematics, v. 323 (31), 228-235, 2022
(G. F. Barros, B. P. Cavalar, G. O. Mota, O. Parczyk)
arXiv:2006.02079
29. Factors in randomly perturbed k-graphs
Random Structures & Algorithms, v. 60 (2), 153-165, 2022
(Y. Chang, J. Han, Y. Kohayakawa, P. Morris, G. O. Mota)
arXiv:2008.01031
28. Constrained colourings of random graphs\
Procedia Computer Science, v. 195, 368-375, 2021
(M. Collares, Y. Kohayakawa, C. G. T. A. Moreira, G. O. Mota)
arXiv:2207.05201
27. Covering 3-coloured random graphs with monochromatic trees
SIAM Journal on Discrete Mathematics, v. 35 (2), 1447-1459, 2021
(Y. Kohayakawa, W. Mendonça, G. O. Mota, B. Schülke)
arXiv:2006.14469
26. The size-Ramsey number of 3-uniform tight paths
Advances in Combinatorics, 2021:5
(J. Han, Y. Kohayakawa, S. Letzter, G. O. Mota, O. Parczyk)
arXiv:1907.08086
25. Locally irregular decomposition of split graphs
Discrete Applied Mathematics, v. 292, p. 33-44, 2021
(C. N. Lintzmayer, G. O. Mota, M. Sambinelli)
arXiv:1902.00986
24. The size-Ramsey number of powers of bounded degree trees
Journal of the London Mathematical Society, v. 103, Issue 4, p.1314-1332, 2020
(S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, O. Parczyk)
arXiv:1907.03466
23. The multicolour size-Ramsey number of powers of paths
Journal of Combinatorial Theory, Series B, v. 145, p. 359-375, 2020
(J. Han, M. Jenssen, Y. Kohayakawa, G. O. Mota, B. Roberts)
arXiv:1811.00844
22. Counting restricted orientations of random graphs
Random Structures & Algorithms, v. 56, p. 1016-1030, 2020
(M. Collares, Y. Kohayakawa, R. Morris, G. O. Mota)
arXiv:1811.03080
2008-2019
21. Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Random Structures & Algorithms, v. 55, Issue 4, p. 795-807, 2019
(W. Bedenknecht, J. Han, Y. Kohayakawa, G. O. Mota)
arXiv:1802.08900
20. Counting Gallai 3-colorings of complete graphs
Discrete Mathematics, v. 342, p. 2618-2631, 2019
(J. Bastos, F. Benevides, G. O. Mota, I. Sau)
arXiv:1805.06805
19. The size-Ramsey number of powers of paths
Journal of Graph Theory, v. 91, Issue 3, p. 290-299, 2019
(D. Clemens, M. Jenssen, Y. Kohayakawa, N. Morrison, G. O. Mota, D. Reding, B. Roberts)
arXiv:1707.04297
18. Three-colour bipartite Ramsey number for graphs with small bandwidth
SIAM Journal on Discrete Mathematics, v. 31, Issue 1, p. 197-208, 2019
(G. O. Mota)
arXiv:1804.02451
17. On the local density problem for graphs of given odd-girth
Journal of Graph Theory, v. 90, Issue 2, p. 137-149, 2019
(W. Bedenknecht, G. O. Mota, C. Reiher, M. Schacht)
arXiv:1609.05712
16. Monochromatic trees in random graphs
Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, p. 191-208, 2019
(Y. Kohayakawa, G. O. Mota, M. Schacht)
arXiv:1611.10299
15. Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version
Contributions to Discrete Mathematics, v. 2, p. 88-100, 2019
(J. O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg)
arXiv:1705.03707
14. Counting sparse k-edge-connected hypergraphs with given number of vertices and edges
Electronic Notes in Theoretical Computer Science: (LAGOS 2019), v. 346, p. 535–544
(C. Hoppen, G. O. Mota, R. F. Parente, C. M. Sato)
Paper - open access
13. Decomposing highly connected graphs into paths of length five
Discrete Applied Mathematics, v. 245, p. 128-138, 2018
(F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi)
arXiv:1505.04309
12. Decomposing regular graphs with prescribed girth into paths of any given length
European Journal of Combinatorics, v. 66, p. 28-36, 2017
(F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi)
arXiv:1509.06393
11. Loose Hamiltonian cycles forced by large (k-2)-degree - approximation version
SIAM Journal on Discrete Mathematics (SIDMA), v. 31, p. 2328-2347, 2017
(J. O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg)
arXiv:1603.04180
10. On an anti-Ramsey threshold for sparse graphs with one triangle
Journal of Graph Theory, v. 87, p. 176-187, 2017
(Y. Kohayakawa, P. B. Konstadinidis, G. O. Mota)
DOI: 10.1002/jgt.22150
9. Counting results for sparse pseudorandom hypergraphs I
European Journal of Combinatorics, v. 65, p. 276-287, 2017
(Y. Kohayakawa, G. O. Mota, M. Schacht, A. Taraz)
arXiv:1602.08782
8. Counting results for sparse pseudorandom hypergraphs II
European Journal of Combinatorics, v. 65, p. 288-301, 2017
(Y. Kohayakawa, G. O. Mota, M. Schacht, A. Taraz)
arXiv:1602.08784
7. Decomposing highly connected graphs into paths of any given length
Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2016
(F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi)
arXiv:1509.06393
6. Decompositions of triangle-free 5-regular graphs into paths of length five
Discrete Mathematics, Vol. 338, Issue 11, p. 1845-1855, 2015
(F. Botler, G. O. Mota, Y. Wakabayashi)
arXiv:1505.04309
5. Ramsey numbers for bipartite graphs with small bandwidth
European Journal of Combinatorics, Vol. 48, p. 165-176, 2015
(G. O. Mota, G. Sárközy, M. Schacht, A. Taraz)
arXiv:1602.05972
4. Network-based disease gene prioritization by hitting time analysis
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Bioengineering, p. 9-14, 2014
(L. A. Lima, S. N. Simões, R. F. Hashimoto, D. C. Martins-Jr, H. Brentani, G. O. Mota)
DOI 10.1109/BIBE.2014.22
3. On the number of orientations of random graphs with no directed cycles of a given length
Electronic Journal of Combinatorics, Vol. 21, Issue 1, 2014
(P. Allen, Y. Kohayakawa, G. O. Mota, R. F. Parente)
Paper - open access
2. On an anti-Ramsey threshold for random graphs
European Journal of Combinatorics, Vol. 40, p. 26-41, 2014
(Y. Kohayakawa, P. B. Konstadinidis, G. O. Mota)
Paper - open access
1. Enumeration of r-modular trees
Proceedings of XL SBPO, p. 2543-2550, 2008
(R. C. Andrade, P. C. Linhares, G. O. Mota)
Proceedings XL SBPO
Extended abstracts
41. A step towards the Sparse Half Conjecture for blow-ups of Vega graphs
Submitted to LAGOS 2025
(C. Bispo, G. O. Mota and W. Mendonça)
40. Ramsey constructions supporting the Diagonal Conjecture
Submitted to LAGOS 2025
(W. Mendonça, M. Miralaei and G. O. Mota)
39. Separating path systems for 2-degenerate graphs
Accepted to EUROCOMB 2025
(C. Fernandes, C. Hoppen, G. Kontogeorgiou, G. O. Mota, and D. Peng)
38. Rainbow path covers of sparse random graphs
Accepted to EUROCOMB 2025
(F. Botler, A. Kaique, W. Mendonça, G. O. Mota and C. Sato)
37. An improvement on the K2-irregular index of bipartite graphs
Accepted to EUROCOMB 2025
(P. S. M. Arraes, C. N. Lintzmayer, G. O. Mota, and M. Sambinelli)
36. A canonical van der Waerden theorem in random sets
Manuscript (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota, and M. Ortega)
35. A canonical Ramsey theorem with list constraints in random graphs
Submitted (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota)
34. Proper edge colorings of complete graphs without repeated triangles
Anais do VII Encontro de Teoria da Computação, ISSN 2595-6116, p. 65–68, 2022
(F. Botler, L. Colucci, P. Matias, G. O. Mota, R. Parente e M. Secco)
33. Oriented graphs with lower orientation Ramsey thresholds
Proceedings of EUROCOMB 2021, to appear
(G. F. Barros, B. P. Cavalar, Y. Kohayakawa, G. O. Mota, Tássio Naia)
32. Counting C*k-free orientations of G(n,p)
Proceedings of EUROCOMB 2021, to appear
(M. Campos, M. Collares, G. O. Mota)
31. Árvores Ramsey-restritas mínimas
Proceedings of ETC 2021, ISSN 2595-6116, p.46–49, 2021
(M. Collares, A. K. B. Fernandes, G. O. Mota, H. Vicente)
30. Covering 3-coloured random graphs with monochromatic trees
Acta Math. Univ. Comenianae: Proceedings of EUROCOMB 2019, v. 88, p. 871–875
(Y. Kohayakawa, W. Mendonça, G. O. Mota, B. Schülke)
29. The size-Ramsey number of powers of bounded degree trees
Acta Math. Univ. Comenianae: Proceedings of EUROCOMB 2019, v. 88, p. 451–456
(S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, O. Parczyk)
28. Anti-Ramsey threshold of cycles for sparse graphs
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 89–98
(G. F. Barros, B. P. Cavalar, G. O. Mota, O. Parczyk)
27. On edge-magic labelling of forests
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 299–307
(M. R. Cerioli, C. G. Fernandes, O. Lee, C. N. Lintzmayer, G. O. Mota, C. N. da Silva)
26. Locally irregular decomposition of split graphs
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 603–612
(C. N. Lintzmayer, G. O. Mota, M. Sambinelli)
25. On the local density problem for graphs of given odd-girth
Proceedings of LAGOS 2017. Electronic Notes in Discrete Mathematics, Vol 62, p. 39–44
(W. Bedenknecht, G. O. Mota, C. Reiher, M. Schacht)
24. Loose Hamiltonian cycles forced by large (k–2)-degree – sharp version
Proceedings of EUROCOMB 2017. Electronic Notes in Discrete Mathematics, Vol 61, p. 101–106
(J. O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg)
23. Monochromatic trees in random graphs
Proceedings of EUROCOMB 2017. Electronic Notes in Discrete Mathematics, Vol 61, p. 759–764
(Y. Kohayakawa, G. O. Mota, M. Schacht)
22. On the number of r-transitive orientations of random graphs
Proceedings of EUROCOMB 2017. Electronic Notes in Discrete Mathematics, Vol 61, p. 255–261
(M. Collares, Y. Kohayakawa, R. Morris, G. O. Mota)
21. Advances in Anti-Ramsey Theory for sparse graphs
Proceedings of the II ETC – CSBC – Encontro de Teoria da Computação, p. 39–42, 2017
(G. O. Mota)
20. O número de tamanho-Ramsey para potências de caminhos
Proceedings of the II ETC – CSBC – Encontro de Teoria da Computação, p. 31–34, 2017
(D. Clemens, M. Jenssen, Y. Kohayakawa, N. Morrison, G. O. Mota, D. Reding, B. Roberts)
19. Loose Hamiltonian cycles forced by large (k–2)-degree – approximation version
Proceedings of the Tenth Jornadas de Matematica Discreta y Algoritmica (JMDA), 2016
(J. O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg)
18. A counting lemma for sparse pseudorandom hypergraphs
Proceedings of LAGOS 2015. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421–426
(Y. Kohayakawa, G. O. Mota, M. Schacht, A. Taraz)
17. Decompositions of highly connected graphs into paths of length five
Proceedings of LAGOS 2015. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421–426
(F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi)
16. Decompositions of highly connected graphs into paths of any given length
Proceedings of EUROCOMB 2015. Electronic Notes in Discrete Mathematics, Vol 49C, p. 795–802
(F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi)
15. Path decompositions of regular graphs with prescribed girth
Proceedings of EUROCOMB 2015. Electronic Notes in Discrete Mathematics, Vol 49C, p. 629–636
(F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi)
14. On an anti-Ramsey threshold for sparse graphs with one triangle
ICGT 2014
(Y. Kohayakawa, P. B. Konstadinidis, G. O. Mota)
13. Path decompositions of triangle-free 5-regular graphs
ICGT 2014
(F. Botler, G. O. Mota, Y. Wakabayashi)
12. Ramsey numbers for bipartite graphs with small bandwidth
Proceedings of EUROCOMB 2013. European Journal on Combinatorics, Vol 16, p. 165–170
(G. O. Mota, G. Sárközy, M. Schacht, A. Taraz)
11. A note on counting orientations
Proceedings of LAGOS 2011. Electronic Notes in Discrete Mathematics, Vol 37
(Y. Kohayakawa, G. O. Mota, R. F. Parente)
10. On an anti-Ramsey property of random graphs
Proceedings of LAGOS 2011. Electronic Notes in Discrete Mathematics, Vol 37
(Y. Kohayakawa, P. B. Konstadinidis, G. O. Mota)
9. Árvores Ramsey-restritas mínimas
Proceedings of ETC 2021, ISSN 2595-6116, p.46–49, 2021
(M. Collares, A. K. B. Fernandes, G. O. Mota, H. Vicente)
8. Covering 3-coloured random graphs with monochromatic trees
Acta Math. Univ. Comenianae: Proceedings of EUROCOMB 2019, v. 88, p. 871–875
(Y. Kohayakawa, W. Mendonça, G. O. Mota, B. Schülke)
7. The size-Ramsey number of powers of bounded degree trees
Acta Math. Univ. Comenianae: Proceedings of EUROCOMB 2019, v. 88, p. 451–456
(S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, O. Parczyk)
6. Anti-Ramsey threshold of cycles for sparse graphs
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 89–98
(G. F. Barros, B. P. Cavalar, G. O. Mota, O. Parczyk)
5. Counting sparse k-edge-connected hypergraphs with given number of vertices and edges
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 535–544
(C. Hoppen, G. O. Mota, R. F. Parente, C. M. Sato)
4. On edge-magic labelling of forests
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 299–307
(M. R. Cerioli, C. G. Fernandes, O. Lee, C. N. Lintzmayer, G. O. Mota, C. N. da Silva)
3. Locally irregular decomposition of split graphs
Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 603–612
(C. N. Lintzmayer, G. O. Mota, M. Sambinelli)
2. On the local density problem for graphs of given odd-girth
Proceedings of LAGOS 2017. Electronic Notes in Discrete Mathematics, Vol 62, p. 39–44
(W. Bedenknecht, G. O. Mota, C. Reiher, M. Schacht)
1. Loose Hamiltonian cycles forced by large (k–2)-degree – sharp version
Proceedings of EUROCOMB 2017. Electronic Notes in Discrete Mathematics, Vol 61, p. 101–106
(J. O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg)