Guilherme Oliveira Mota

[LAGOS 2020]

      Associate Professor
      Departamento de Ciência da Computação (DCC)
      Instituto de Matemática e Estatística (IME)
      Universidade de São Paulo (USP), Brazil

      ArXiv papers / Scopus / Google Scholar / Curriculum Lattes
      Email: mota@ime.usp.br



Articles



  1. Counting orientations of graphs with no strongly connected tournaments
    Discrete Mathematics, to appear
    (F. Botler, C. Hoppen, G. O. Mota)

  2. Anti-Ramsey threshold of cycles
    Discrete Applied Mathematics, to appear
    (G. F. Barros, B. P. Cavalar, G. O. Mota, O. Parczyk)

  3. Factors in randomly perturbed k-graphs
    Random Structures & Algorithms, v. 60 (2), 153-165, 2021
    (Y. Chang, J. Han, Y. Kohayakawa, P. Morris, G. O. Mota)

  4. 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)

  5. 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)

  6. The size-Ramsey number of powers of bounded degree trees.
    Journal of the London Mathematical Society, v. 103, Issue 4, p.1314-1332, 2021
    (S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, O. Parczyk)

  7. Locally irregular decomposition of split graphs
    Discrete Applied Mathematics, v. 292, 31 p. 33-44, 2021
    (C. N. Lintzmayer, G. O. Mota, M. Sambinelli)

  8. 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)

  9. Counting restricted orientations of random graphs
    Random Structures & Algorithms, v. 56, p. 1016-1030, 2020. (M. Collares, Y. Kohayakawa, R. Morris, G. O. Mota)

  10. 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)

  11. Counting Gallai 3-colorings of complete graphs
    Discrete Mathematics, v. 342, p. 2618-2631, 2019 (J. Bastos, F. Benevides, G. O. Mota, I. Sau)

  12. 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)

  13. 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)

  14. 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)

  16. 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).

  17. 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).

  18. 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).

  19. 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).

  20. 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).

  21. 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).

  22. 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).

  23. 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).

  24. 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).

  25. 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).

  26. 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).

  27. 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).

  28. 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).

  29. Enumeration of r-modular trees
    Proceedings of XL SBPO, p. 2543-2550, 2008. (R. C. Andrade, P. C. Linhares, G. O. Mota).


Extended abstracts

  1. Oriented graphs with lower orientation Ramsey thresholds
    Proceedings of EUROCOMB'21, to appear
    (G. F. Barros, B. P. Cavalar, Y. Kohayakawa, G. O. Mota, Tássio Naia)

  2. Counting C_k-free orientations of G(n,p)
    Proceedings of EUROCOMB'21, to appear
    (M. Campos, M. Collares, G. O. Mota)

  3. Constrained colourings of random graphs
    Proceedings of LAGOS 2021, to appear
    (M. Collares, Y. Kohayakawa, C. G. T. A. Moreira, G. O. Mota)

  4. Árvores Ramsey-restritas mínimas
    Proceedings of ETC 2021, to appear
    (M. Collares, A. K. B. Fernandes, G. O. Mota, H. Vicente)

  5. Covering 3-coloured random graphs with monochromatic trees.
    Acta Math. Univ. Comenianae: Proceedings of EUROCOMB'19, v. 88, p. 871-875, 2019
    (Y. Kohayakawa, W. Mendonça, G. O. Mota, B. Schülke)

  6. The size-Ramsey number of powers of bounded degree trees.
    Acta Math. Univ. Comenianae: Proceedings of EUROCOMB'19, v. 88, p. 451-456, 2019
    (S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, O. Parczyk)

  7. Anti-Ramsey threshold of cycles for sparse graphs
    Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 89-98, 2019
    (G. F. Barros, B. P. Cavalar, G. O. Mota, O. Parczyk)

  8. 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, 2019
    (C. Hoppen, G. O. Mota, R. F. Parente, C. M. Sato)

  9. On edge-magic labelling of forests
    Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 299-307, 2019
    (M. R. Cerioli, C. G. Fernandes, O. Lee, C. N. Lintzmayer, G. O. Mota, C. N. da Silva)

  10. Locally irregular decomposition of split graphs
    Electronic Notes in Theoretical Computer Science: Proceedings of LAGOS 2019, v. 346. p. 603-612, 2019
    (C. N. Lintzmayer, G. O. Mota, M. Sambinelli)

  11. On the local density problem for graphs of given odd-girth
    Proceedings of LAGOS'17. Electronic Notes in Discrete Mathematics, Vol 62, p. 39-44, 2017
    (W. Bedenknecht, G. O. Mota, C. Reiher, M. Schacht).

  12. Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version
    Proceedings of EUROCOMB'17. Electronic Notes in Discrete Mathematics, Vol 61, p. 101-106, 2017
    (J. O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg).

  13. Monochromatic trees in random graphs
    Proceedings of EUROCOMB'17. Electronic Notes in Discrete Mathematics, Vol 61, p. 759-764, 2017
    (Y. Kohayakawa, G. O. Mota, M. Schacht)

  14. On the number of r-transitive orientations of random graphs
    Proceedings of EUROCOMB'17. Electronic Notes in Discrete Mathematics, Vol 61, p. 255-261, 2017
    (M. Collares, Y. Kohayakawa, R. Morris, G. O. Mota)

  15. 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)

  16. 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)

  17. 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'15. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421-426, 2015
    (Y. Kohayakawa, G. O. Mota, M. Schacht, A. Taraz).

  19. Decompositions of highly connected graphs into paths of length five
    Proceedings of LAGOS'15. Electronic Notes in Discrete Mathematics, Vol 50C, p. 421-426, 2015
    (F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi ).

  20. Decompositions of highly connected graphs into paths of any given length
    Proceedings of EUROCOMB'15. Electronic Notes in Discrete Mathematics, Vol 49C, p. 795-802, 2015
    (F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).

  21. Path decompositions of regular graphs with prescribed girth
    Proceedings of EUROCOMB'15. Electronic Notes in Discrete Mathematics, Vol 49C, p. 629-636, 2015
    (F. Botler, G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).

  22. On an anti-Ramsey threshold for sparse graphs with one triangle
    ICGT 2014 (Y. Kohayakawa, P.B. Konstadinidis, G.O. Mota).

  23. Path decompositions of triangle-free 5-regular graphs
    ICGT 2014 (F. Botler, G. O. Mota, Y. Wakabayashi).

  24. Ramsey numbers for bipartite graphs with small bandwidth
    Proceedings of Eurocomb 2013. European Journal on Combinatorics, Vol 16, p. 165-170, 2013
    (G. O. Mota, G. Sárközy, M. Schacht, A. Taraz).

  25. A note on counting orientations
    Proceedings of LAGOS'11. Electronic Notes in Discrete Mathematics, Vol 37 (Y. Kohayakawa, G. O. Mota, R. F. Parente).

  26. On an anti-Ramsey property of random graphs
    Proceedings of LAGOS'11. Electronic Notes in Discrete Mathematics, Vol 37 (Y.Kohayakawa, P. B. Konstadinidis, G. O. Mota).

Theses


Guilherme Oliveira Mota mota@ime.usp.br
Instituto de Matemática e Estatística da Universidade de São Paulo - São Paulo - Brasil
Rua do Matão, 1010 - CEP 05508-090 - São Paulo - SP