List of all coauthors of the papers below: list of coauthors
Articles
2021-2024
40. A canonical van der Waerden theorem in random sets
Submitted (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota,
and M. Ortega)
39. Separating path systems in complete graphs
Submitted (C. G. Fernandes, N. Sanhueza-Matamala, G. O. Mota)
38. A canonical Ramsey theorem for even cycles in random graphs
Manuscript (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota)
37. A canonical Ramsey theorem with list constraints in random graphs
Manuscript (J. D. Alvarado, Y. Kohayakawa, P. Morris, G. O. Mota)
36. Resilience for loose Hamilton cycles
Submitted (J. D. Alvarado, Y. Kohayakawa, R. Lang, G. O. Mota, H. Stagni)
35. Counting graph orientations with no directed triangles
Submitted (P. Araújo, F. Botler, G. O. Mota)
34. 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)
33. Directed graphs with lower orientation Ramsey thresholds
RAIRO, to appear (G. F. Barros, B. P. Cavalar, Y. Kohayakawa, G. O. Mota, T. Naia)
32. 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)
31. Anti-Ramsey threshold of complete graphs
Discrete Mathematics, v. 346 (5), 2023
(Y. Kohayakawa, G. O. Mota, J. Schnitzer, O. Parczyk)
30. Counting orientations of graphs with no strongly connected tournaments
Discrete Mathematics, v. 345 (12), 2022
(F. Botler, C. Hoppen, G. O. Mota)
29. 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)
28. 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)
27. 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)
26. 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)
25. The size-Ramsey number of 3-uniform tight paths
Advances in Combinatorics, 2021:5 - Read paper at ArXiv (https://doi.org/10.19086/aic.24581)
(J. Han, Y. Kohayakawa, S. Letzter, G. O. Mota, O. Parczyk)
24. Locally irregular decomposition of split graphs
Discrete Applied Mathematics, v. 292, 31 p. 33-44, 2021
(C. N. Lintzmayer, G. O. Mota, M. Sambinelli)
23. 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)
22. 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)
21. Counting restricted orientations of random graphs
Random Structures & Algorithms, v. 56, p. 1016-1030, 2020
(M. Collares, Y. Kohayakawa, R. Morris, G. O. Mota)
2008-2020
20. Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Random Structures & Algorithms, v. 55, Issue 4, p. 795-807, 2019
(W. Bedenknecht, Y. Kohayakawa, J. Han, G. O. Mota)
19. Counting Gallai 3-colorings of complete graphs
Discrete Mathematics, v. 342, p. 2618-2631, 2019
(J. Bastos, F. Benevides, G. O. Mota, I. Sau)
18. 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)
17. 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)
16. 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)
15. 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)
14. 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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
1. Enumeration of r-modular trees
Proceedings of XL SBPO, p. 2543-2550, 2008
(R. C. Andrade, P. C. Linhares, G. O. Mota)