On an anti-Ramsey property of random graphs. - Yoshiharu Kohayakawa; P. B. Konstadinidis; Guilherme Oliveira Mota (Electron. Notes Discret. Math., 2011)

A note on counting orientations. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Roberto F. Parente (Electron. Notes Discret. Math., 2011)

Two problems in modern combinatorics. - Guilherme Oliveira Mota (2013)

Network-Based Disease Gene Prioritization by Hitting Time Analysis. - Leandro de A. Lima; Sérgio Nery Simões; Ronaldo Fumio Hashimoto; David Correa Martins Jr.; Helena Paula Brentani; Guilherme Oliveira Mota (BIBE, 2014)

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. - Peter Allen 001; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Roberto F. Parente (Electron. J. Comb., 2014)

On an anti-Ramsey threshold for random graphs. - Yoshiharu Kohayakawa; P. B. Konstadinidis; Guilherme Oliveira Mota (Eur. J. Comb., 2014)

Decompositions of triangle-free 5-regular graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; Yoshiko Wakabayashi (Discret. Math., 2015)

Ramsey numbers for bipartite graphs with small bandwidth. - Guilherme Oliveira Mota; Gábor N. Sárközy; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2015)

Path decompositions of regular graphs with prescribed girth. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Decompositions of highly connected graphs into paths of any given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Decompositions of highly connected graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

A counting lemma for sparse pseudorandom hypergraphs. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2015)

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version. - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Electron. Notes Discret. Math., 2016)

Decomposing regular graphs with prescribed girth into paths of given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Eur. J. Comb., 2017)

Counting results for sparse pseudorandom hypergraphs I. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2017)

Counting results for sparse pseudorandom hypergraphs II. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2017)

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Electron. Notes Discret. Math., 2017)

Monochromatic trees in random graphs. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht (Electron. Notes Discret. Math., 2017)

On the number of r-transitive orientations of G(n, p). - Maurício Collares Neto; Yoshiharu Kohayakawa; Robert Morris 001; Guilherme Oliveira Mota (Electron. Notes Discret. Math., 2017)

Decomposing highly edge-connected graphs into paths of any given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (J. Comb. Theory B, 2017)

Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (SIAM J. Discret. Math., 2017)

Decomposing highly connected graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Discret. Appl. Math., 2018)

On an anti-Ramsey threshold for sparse graphs with one triangle. - Yoshiharu Kohayakawa; P. B. Konstadinidis; Guilherme Oliveira Mota (J. Graph Theory, 2018)

Counting Gallai 3-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Guilherme Oliveira Mota; Ignasi Sau (Discret. Math., 2019)

Anti-Ramsey Threshold of Cycles for Sparse Graphs. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Guilherme Oliveira Mota; Olaf Parczyk (LAGOS, 2019)

On Edge-magic Labelings of Forests. - Márcia R. Cerioli; Cristina G. Fernandes; Orlando Lee; Carla Negri Lintzmayer; Guilherme Oliveira Mota; Cândida Nunes da Silva (LAGOS, 2019)

Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. - Carlos Hoppen; Guilherme Oliveira Mota; Roberto F. Parente; Cristiane M. Sato (LAGOS, 2019)

On the local density problem for graphs of given odd-girth. - Wiebke Bedenknecht; Guilherme Oliveira Mota; Christian Reiher; Mathias Schacht (J. Graph Theory, 2019)

The size?Ramsey number of powers of paths. - Dennis Clemens; Matthew Jenssen; Yoshiharu Kohayakawa; Natasha Morrison; Guilherme Oliveira Mota; Damian Reding; Barnaby Roberts (J. Graph Theory, 2019)

Powers of tight Hamilton cycles in randomly perturbed hypergraphs. - Wiebke Bedenknecht; Jie Han 002; Yoshiharu Kohayakawa; Guilherme Oliveira Mota (Random Struct. Algorithms, 2019)

Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth. - Guilherme Oliveira Mota (SIAM J. Discret. Math., 2019)

The multicolour size-Ramsey number of powers of paths. - Jie Han 002; Matthew Jenssen; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Barnaby Roberts (J. Comb. Theory B, 2020)

Counting restricted orientations of random graphs. - Maurício Collares Neto; Yoshiharu Kohayakawa; Robert Morris 001; Guilherme Oliveira Mota (Random Struct. Algorithms, 2020)

Constrained colourings of random graphs. - Maurício Collares Neto; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Guilherme Oliveira Mota (LAGOS, 2021)

Decomposing split graphs into locally irregular graphs. - Carla Negri Lintzmayer; Guilherme Oliveira Mota; Maycon Sambinelli (Discret. Appl. Math., 2021)

Covering 3-Edge-Colored Random Graphs with Monochromatic Trees. - Yoshiharu Kohayakawa; Walner Mendonça; Guilherme Oliveira Mota; Bjarne Schülke (SIAM J. Discret. Math., 2021)

Anti-Ramsey threshold of cycles. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Guilherme Oliveira Mota; Olaf Parczyk (Discret. Appl. Math., 2022)

Counting orientations of graphs with no strongly connected tournaments. - Fábio Botler; Carlos Hoppen; Guilherme Oliveira Mota (Discret. Math., 2022)

Factors in randomly perturbed hypergraphs. - Yulin Chang; Jie Han 002; Yoshiharu Kohayakawa; Patrick Morris 001; Guilherme Oliveira Mota (Random Struct. Algorithms, 2022)

A canonical Ramsey theorem with list constraints in random graphs. - José D. Alvarado; Yoshiharu Kohayakawa; Patrick Morris 001; Guilherme Oliveira Mota (LAGOS, 2023)

Resilience for loose Hamilton cycles. - José D. Alvarado; Yoshiharu Kohayakawa; Richard Lang; Guilherme Oliveira Mota; Henrique Stagni (LAGOS, 2023)

The anti-Ramsey threshold of complete graphs. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Olaf Parczyk; Jakob Schnitzer (Discret. Math., 2023)

On the Anti-Ramsey Threshold for Non-Balanced Graphs. - Pedro Araújo; Taísa Martins; Letícia Mattos; Walner Mendonça; Luiz Moreira; Guilherme Oliveira Mota (Electron. J. Comb., 2024)

Directed graphs with lower orientation Ramsey thresholds. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Tássio Naia (RAIRO Oper. Res., 2024)

Counting orientations of random graphs with no directed k-cycles. - Marcelo Campos; Maurício Collares Neto; Guilherme Oliveira Mota (Random Struct. Algorithms, 2024)

Counting Graph Orientations with No Directed Triangles. - Pedro Araújo; Fábio Botler; Guilherme Oliveira Mota (Electron. J. Comb., 2025)

Separating Path Systems in Complete Graphs. - Cristina G. Fernandes; Guilherme Oliveira Mota; Nicolás Sanhueza-Matamala (Random Struct. Algorithms, 2025)