Guilherme Oliveira Mota

      - Professor Adjunto - Room 530-2 - Block A - Tower 2 - Santo André
      - Vice coordinator - Graduate Program in Computer Science (2019-2021)
      - Centro de Matemática, Computação e Cognição (CMCC)
      - Universidade Federal do ABC (UFABC), Brazil

      - PhD in Computer Science at USP (Advisor: Yoshiharu Kohayakawa)
      - I was a postdoc of Yoshiharu Kohayakawa (USP),
        Mathias Schacht (UHH), and Anusch Taraz (TUHH)

     
ArXiv papers / Scopus / Google Scholar / Curriculum Lattes
      Email: g.mota@ufabc.edu.br

Articles



  1. The multicolour size-Ramsey number of powers of paths.
    Journal of Combinatorial Theory, Series B, to appear (J. Han, M. Jenssen, Y. Kohayakawa, G. O. Mota, B. Roberts)

  2. Counting restricted orientations of random graphs.
    Random Structures & Algorithms, to appear (M. Collares, Y. Kohayakawa, R. Morris, G. O. Mota)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  22. 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. Covering 3-coloured random graphs with monochromatic trees.
    Proceedings of EUROCOMB'19, to appear
    (Y. Kohayakawa, W. Mendonça, G. O. Mota, B. Schülke)

  2. The size-Ramsey number of powers of bounded degree trees.
    Proceedings of EUROCOMB'19, to appear
    (S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, O. Parczyk)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  22. 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 - g.mota@ufabc.edu.br
CMCC - UFABC
Centro de Matemática, Computação e Cognição - Universidade Federal do ABC
Avenida dos Estados, 5001 - Santa Terezinha - Santo André - SP - Brasil - CEP 09210-580