List of all coauthors of the papers below: list of coauthors

Full papers

2020-2025

  • 42.
    C. Fernandes , C. Hoppen , G. Kontogeorgiou , G. O. Mota , D. Peng .
    Separating path systems for cubic graphs and for complete bipartite graphs.
    Submitted, 2025. [arXiv]
  • 41.
    W. Mendonça , M. Miralaei , G. O. Mota .
    Graphs with asymmetric Ramsey properties.
    Submitted, 2025. [arXiv]
  • 40.
    J. D. Alvarado , Y. Kohayakawa , P. Morris , G. O. Mota , M. Ortega .
    A sparse canonical van der Waerden theorem.
    Submitted, 2025. [arXiv]
  • 39.
    J. D. Alvarado , Y. Kohayakawa , P. Morris , G. O. Mota .
    A canonical Ramsey theorem for even cycles in random graphs.
    Submitted, 2025. [arXiv]
  • 38.
    J. D. Alvarado , Y. Kohayakawa , P. Morris , G. O. Mota .
    A canonical Ramsey theorem with list constraints in random graphs.
    Submitted, 2023. [arXiv]
  • 37.
    C. G. Fernandes , N. Sanhueza-Matamala , G. O. Mota .
    Separating path systems in complete graphs.
    Random Structures & Algorithms, v. 66 (3), e70006, 2025. [arXiv]
  • 36.
    P. Araújo , F. Botler , G. O. Mota .
    Counting graph orientations with no directed triangles.
    Electronic Journal of Combinatorics, v. 32 (3) P3.2, 2025. [arXiv]
  • 35.
    J. D. Alvarado , Y. Kohayakawa , R. Lang , G. O. Mota , H. Stagni .
    Resilience for loose Hamilton cycles.
    Accepted for publication - Forum of Mathematics Sigma, 2025. [arXiv]
  • 34.
    M. Campos , M. Collares , G. O. Mota .
    Counting orientations of random graphs with no directed k-cycles.
    Random Structures & Algorithms, v. 64 (3), 676-691, 2024. [arXiv]
  • 33.
    G. F. Barros , B. P. Cavalar , Y. Kohayakawa , G. O. Mota , T. Naia .
    Directed graphs with lower orientation Ramsey thresholds.
    RAIRO, v. 8 (4), 3607-3619, 2024. [arXiv]
  • 32.
    P. Araújo , T. Martins , L. Mattos , W. Mendonça , L. Moreira , G. O. Mota .
    On the anti-Ramsey threshold for non-balanced graphs.
    Electronic Journal of Combinatorics, v. 31 (1), P1.70, 2024. [arXiv]
  • 31.
    Y. Kohayakawa , G. O. Mota , J. Schnitzer , O. Parczyk .
    Anti-Ramsey threshold of complete graphs.
    Discrete Mathematics, v. 346 (5), 2023. [arXiv]
  • 30.
    F. Botler , C. Hoppen , G. O. Mota .
    Counting orientations of graphs with no strongly connected tournaments.
    Discrete Mathematics, v. 345 (12), 2022. [arXiv]
  • 29.
    G. F. Barros , B. P. Cavalar , G. O. Mota , O. Parczyk .
    Anti-Ramsey threshold of cycles.
    Discrete Applied Mathematics, v. 323 (31), 228-235, 2022. [arXiv]
  • 28.
    Y. Chang , J. Han , Y. Kohayakawa , P. Morris , G. O. Mota .
    Factors in randomly perturbed k-graphs.
    Random Structures & Algorithms, v. 60 (2), 153-165, 2022. [arXiv]
  • 27.
    M. Collares , Y. Kohayakawa , C. G. T. A. Moreira , G. O. Mota .
    Constrained colourings of random graphs.
    Procedia Computer Science, v. 195, 368-375, 2021. [arXiv]
  • 26.
    Y. Kohayakawa , W. Mendonça , G. O. Mota , B. Schülke .
    Covering 3-coloured random graphs with monochromatic trees.
    SIAM Journal on Discrete Mathematics, v. 35 (2), 1447-1459, 2021. [arXiv]
  • 25.
    J. Han , Y. Kohayakawa , S. Letzter , G. O. Mota , O. Parczyk .
    The size-Ramsey number of 3-uniform tight paths.
    Advances in Combinatorics, 2021:5, 2021. [arXiv]
  • 24.
    C. N. Lintzmayer , G. O. Mota , M. Sambinelli .
    Locally irregular decomposition of split graphs.
    Discrete Applied Mathematics, v. 292, p. 33-44, 2021. [arXiv]
  • 23.
    S. Berger , Y. Kohayakawa , G. S. Maesaka , T. Martins , W. Mendonça , G. O. Mota , O. Parczyk .
    The size-Ramsey number of powers of bounded degree trees.
    Journal of the London Mathematical Society, v. 103, Issue 4, p.1314-1332, 2020. [arXiv]
  • 22.
    J. Han , M. Jenssen , Y. Kohayakawa , G. O. Mota , B. Roberts .
    The multicolour size-Ramsey number of powers of paths.
    Journal of Combinatorial Theory, Series B, v. 145, p. 359-375, 2020. [arXiv]
  • 21.
    M. Collares , Y. Kohayakawa , R. Morris , G. O. Mota .
    Counting restricted orientations of random graphs.
    Random Structures & Algorithms, v. 56, p. 1016-1030, 2020. [arXiv]

2008-2019

  • 20.
    W. Bedenknecht , J. Han , Y. Kohayakawa , G. O. Mota .
    Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
    Random Structures & Algorithms, v. 55, Issue 4, p. 795-807, 2019. [arXiv]
  • 19.
    J. Bastos , F. Benevides , G. O. Mota , I. Sau .
    Counting Gallai 3-colorings of complete graphs.
    Discrete Mathematics, v. 342, p. 2618-2631, 2019. [arXiv]
  • 18.
    D. Clemens , M. Jenssen , Y. Kohayakawa , N. Morrison , G. O. Mota , D. Reding , B. Roberts .
    The size-Ramsey number of powers of paths.
    Journal of Graph Theory, v. 91, Issue 3, p. 290-299, 2019. [arXiv]
  • 17.
    G. O. Mota .
    Three-colour bipartite Ramsey number for graphs with small bandwidth.
    SIAM Journal on Discrete Mathematics, v. 31, Issue 1, p. 197-208, 2019. [arXiv]
  • 16.
    W. Bedenknecht , G. O. Mota , C. Reiher , M. Schacht .
    On the local density problem for graphs of given odd-girth.
    Journal of Graph Theory, v. 90, Issue 2, p. 137-149, 2019. [arXiv]
  • 15.
    Y. Kohayakawa , G. O. Mota , M. Schacht .
    Monochromatic trees in random graphs.
    Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, p. 191-208, 2019. [arXiv]
  • 14.
    J. O. Bastos , G. O. Mota , M. Schacht , J. Schnitzer , F. Schulenburg .
    Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version.
    Contributions to Discrete Mathematics, v. 2, p. 88-100, 2019. [arXiv]
  • 13.
    C. Hoppen , G. O. Mota , R. F. Parente , C. M. Sato .
    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, 2019. [Paper - open access]
  • 12.
    F. Botler , G. O. Mota , M. T. I. Oshiro , Y. Wakabayashi .
    Decomposing highly connected graphs into paths of length five.
    Discrete Applied Mathematics, v. 245, p. 128-138, 2018. [arXiv]
  • 11.
    F. Botler , G. O. Mota , M. T. I. Oshiro , Y. Wakabayashi .
    Decomposing regular graphs with prescribed girth into paths of any given length.
    European Journal of Combinatorics, v. 66, p. 28-36, 2017. [arXiv]
  • 10.
    J. O. Bastos , G. O. Mota , M. Schacht , J. Schnitzer , F. Schulenburg .
    Loose Hamiltonian cycles forced by large (k-2)-degree - approximation version.
    SIAM Journal on Discrete Mathematics (SIDMA), v. 31, p. 2328-2347, 2017. [arXiv]
  • 9.
    Y. Kohayakawa , P. B. Konstadinidis , G. O. Mota .
    On an anti-Ramsey threshold for sparse graphs with one triangle.
    Journal of Graph Theory, v. 87, p. 176-187, 2017. [DOI: 10.1002/jgt.22150]
  • 8.
    Y. Kohayakawa , G. O. Mota , M. Schacht , A. Taraz .
    Counting results for sparse pseudorandom hypergraphs I.
    European Journal of Combinatorics, v. 65, p. 276-287, 2017. [arXiv]
  • 7.
    Y. Kohayakawa , G. O. Mota , M. Schacht , A. Taraz .
    Counting results for sparse pseudorandom hypergraphs II.
    European Journal of Combinatorics, v. 65, p. 288-301, 2017. [arXiv]
  • 6.
    F. Botler , G. O. Mota , M. T. I. Oshiro , Y. Wakabayashi .
    Decomposing highly connected graphs into paths of any given length.
    Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2016. [arXiv]
  • 5.
    F. Botler , G. O. Mota , Y. Wakabayashi .
    Decompositions of triangle-free 5-regular graphs into paths of length five.
    Discrete Mathematics, Vol. 338, Issue 11, p. 1845-1855, 2015. [arXiv]
  • 4.
    G. O. Mota , G. Sárközy , M. Schacht , A. Taraz .
    Ramsey numbers for bipartite graphs with small bandwidth.
    European Journal of Combinatorics, Vol. 48, p. 165-176, 2015. [arXiv]
  • 3.
    L. A. Lima , S. N. Simões , R. F. Hashimoto , D. C. Martins-Jr , H. Brentani , G. O. Mota .
    Network-based disease gene prioritization by hitting time analysis.
    Proceedings of the 2014 IEEE International Conference on Bioinformatics and Bioengineering, p. 9-14, 2014. [DOI 10.1109/BIBE.2014.22]
  • 2.
    P. Allen , Y. Kohayakawa , G. O. Mota , R. F. Parente .
    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. [Paper - open access]
  • 1.
    Y. Kohayakawa , P. B. Konstadinidis , G. O. Mota .
    On an anti-Ramsey threshold for random graphs.
    European Journal of Combinatorics, Vol. 40, p. 26-41, 2014. [Paper - open access]

Extended Abstracts

  • 31.
    W. Mendonça , M. Miralaei , G. O. Mota .
    Graphs with asymmetric Ramsey properties.
    Accepted to LAGOS 2025, 2025.
  • 30.
    C. Fernandes , C. Hoppen , G. Kontogeorgiou , G. O. Mota , D. Peng .
    Separating path systems for 2-degenerate graphs.
    Accepted to EUROCOMB 2025, 2025.
  • 29.
    F. Botler , A. Kaique , W. Mendonça , G. O. Mota , C. Sato .
    Rainbow path covers of sparse random graphs.
    Accepted to EUROCOMB 2025, 2025.
  • 28.
    P. S. M. Arraes , C. N. Lintzmayer , G. O. Mota , M. Sambinelli .
    An improvement on the K2-irregular index of bipartite graphs.
    Accepted to EUROCOMB 2025, 2025.
  • 27.
    J. D. Alvarado , Y. Kohayakawa , P. Morris , G. O. Mota , M. Ortega .
    A canonical van der Waerden theorem in random sets.
    Manuscript, 2025.
  • 26.
    J. D. Alvarado , Y. Kohayakawa , P. Morris , G. O. Mota .
    A canonical Ramsey theorem with list constraints in random graphs.
    Submitted, 2025.
  • 25.
    F. Botler , L. Colucci , P. Matias , G. O. Mota , R. Parente , M. Secco .
    Proper edge colorings of complete graphs without repeated triangles.
    Anais do VII Encontro de Teoria da Computação, p. 65–68, 2022.
  • 24.
    G. F. Barros , B. P. Cavalar , Y. Kohayakawa , G. O. Mota , T. Naia .
    Oriented graphs with lower orientation Ramsey thresholds.
    Proceedings of EUROCOMB 2021, 2021.
  • 23.
    M. Campos , M. Collares , G. O. Mota .
    Counting C_k-free orientations of G(n,p).
    Proceedings of EUROCOMB 2021, 2021.
  • 22.
    M. Collares , A. K. B. Fernandes , G. O. Mota , H. Vicente .
    Árvores Ramsey-restritas mínimas.
    Proceedings of ETC 2021, p.46–49, 2021.
  • 21.
    Y. Kohayakawa , W. Mendonça , G. O. Mota , B. Schülke .
    Covering 3-coloured random graphs with monochromatic trees.
    Acta Math. Univ. Comenianae: Proceedings of EUROCOMB 2019, v. 88, p. 871–875, 2019.
  • 20.
    S. Berger , Y. Kohayakawa , G. S. Maesaka , T. Martins , W. Mendonça , G. O. Mota , O. Parczyk .
    The size-Ramsey number of powers of bounded degree trees.
    Acta Math. Univ. Comenianae: Proceedings of EUROCOMB 2019, v. 88, p. 451–456, 2019.
  • 19.
    G. F. Barros , B. P. Cavalar , G. O. Mota , O. Parczyk .
    Anti-Ramsey threshold of cycles for sparse graphs.
    Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 89–98, 2019.
  • 18.
    M. R. Cerioli , C. G. Fernandes , O. Lee , C. N. Lintzmayer , G. O. Mota , C. N. da Silva .
    On edge-magic labelling of forests.
    Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 299–307, 2019.
  • 17.
    C. N. Lintzmayer , G. O. Mota , M. Sambinelli .
    Locally irregular decomposition of split graphs.
    Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346, p. 603–612, 2019.
  • 16.
    W. Bedenknecht , G. O. Mota , C. Reiher , M. Schacht .
    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, 2017.
  • 15.
    J. O. Bastos , G. O. Mota , M. Schacht , J. Schnitzer , F. Schulenburg .
    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, 2017.
  • 14.
    Y. Kohayakawa , G. O. Mota , M. Schacht .
    Monochromatic trees in random graphs.
    Proceedings of EUROCOMB 2017. Electronic Notes in Discrete Mathematics, Vol 61, p. 759–764, 2017.
  • 13.
    M. Collares , Y. Kohayakawa , R. Morris , G. O. Mota .
    On the number of r-transitive orientations of random graphs.
    Proceedings of EUROCOMB 2017. Electronic Notes in Discrete Mathematics, Vol 61, p. 255–261, 2017.
  • 12.
    G. O. Mota .
    Advances in Anti-Ramsey Theory for sparse graphs.
    Proceedings of the II ETC – CSBC, p. 39–42, 2017.
  • 11.
    D. Clemens , M. Jenssen , Y. Kohayakawa , N. Morrison , G. O. Mota , D. Reding , B. Roberts .
    O número de tamanho-Ramsey para potências de caminhos.
    Proceedings of the II ETC – CSBC, p. 31–34, 2017.
  • 10.
    J. O. Bastos , G. O. Mota , M. Schacht , J. Schnitzer , F. Schulenburg .
    Loose Hamiltonian cycles forced by large (k–2)-degree – approximation version.
    Proceedings of the Tenth Jornadas de Matematica Discreta y Algoritmica (JMDA), 2016.
  • 9.
    Y. Kohayakawa , G. O. Mota , M. Schacht , A. Taraz .
    A counting lemma for sparse pseudorandom hypergraphs.
    Proceedings of LAGOS 2015. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421–426, 2015.
  • 8.
    F. Botler , G. O. Mota , M. T. I. Oshiro , Y. Wakabayashi .
    Decompositions of highly connected graphs into paths of length five.
    Proceedings of LAGOS 2015. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421–426, 2015.
  • 7.
    F. Botler , G. O. Mota , M. T. I. Oshiro , Y. Wakabayashi .
    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, 2015.
  • 6.
    F. Botler , G. O. Mota , M. T. I. Oshiro , Y. Wakabayashi .
    Path decompositions of regular graphs with prescribed girth.
    Proceedings of EUROCOMB 2015. Electronic Notes in Discrete Mathematics, Vol 49C, p. 629–636, 2015.
  • 5.
    Y. Kohayakawa , P. B. Konstadinidis , G. O. Mota .
    On an anti-Ramsey threshold for sparse graphs with one triangle.
    ICGT 2014, 2014.
  • 4.
    F. Botler , G. O. Mota , Y. Wakabayashi .
    Path decompositions of triangle-free 5-regular graphs.
    ICGT 2014, 2014.
  • 3.
    G. O. Mota , G. Sárközy , M. Schacht , A. Taraz .
    Ramsey numbers for bipartite graphs with small bandwidth.
    Proceedings of EUROCOMB 2013. European Journal on Combinatorics, Vol 16, p. 165–170, 2013.
  • 2.
    Y. Kohayakawa , G. O. Mota , R. F. Parente .
    A note on counting orientations.
    Proceedings of LAGOS 2011. Electronic Notes in Discrete Mathematics, Vol 37, 2011.
  • 1.
    Y. Kohayakawa , P. B. Konstadinidis , G. O. Mota .
    On an anti-Ramsey property of random graphs.
    Proceedings of LAGOS 2011. Electronic Notes in Discrete Mathematics, Vol 37, 2011.