Guilherme Oliveira Mota

57 papers C 10Journal 45Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Canonical Ramsey Theorem with List Constraints in Random (Hyper-)graphs.
Electron. J. Comb.
José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2026 J jnl
Separating path systems for cubic graphs and for complete bipartite graphs.
Discret. Math.
Cristina G. Fernandes, Carlos Hoppen, George Kontogeorgiou, Guilherme Oliveira Mota, Danni Peng
2025 J jnl
Counting Graph Orientations with No Directed Triangles.
Electron. J. Comb.
Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota
2025 C conf
Graphs with asymmetric Ramsey properties.
LAGOS
Walner Mendonça, Meysam Miralaei, Guilherme Oliveira Mota
2025 J jnl
Separating Path Systems in Complete Graphs.
Random Struct. Algorithms
Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala
2024 J jnl
Counting orientations of random graphs with no directed
Random Struct. Algorithms
Marcelo Campos, Maurício Collares Neto, Guilherme Oliveira Mota
2024 J jnl
Directed graphs with lower orientation Ramsey thresholds.
RAIRO Oper. Res.
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Tássio Naia
2024 J jnl
On the Anti-Ramsey Threshold for Non-Balanced Graphs.
Electron. J. Comb.
Pedro Araújo, Taísa Martins, Letícia Mattos, Walner Mendonça, Luiz Moreira, Guilherme Oliveira Mota
2024 — conf
Separating Path Systems in Complete Graphs.
LATIN (2)
Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala
2023 C conf
A canonical Ramsey theorem with list constraints in random graphs.
LAGOS
José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2023 C conf
Resilience for loose Hamilton cycles.
LAGOS
José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni
2023 J jnl
The anti-Ramsey threshold of complete graphs.
Discret. Math.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk, Jakob Schnitzer
2022 J jnl
Anti-Ramsey threshold of cycles.
Discret. Appl. Math.
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk
2022 J jnl
Counting orientations of graphs with no strongly connected tournaments.
Discret. Math.
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
2022 J jnl
Factors in randomly perturbed hypergraphs.
Random Struct. Algorithms
Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2021 C conf
Constrained colourings of random graphs.
LAGOS
Maurício Collares Neto, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Guilherme Oliveira Mota
2021 C conf
Counting orientations of graphs with no strongly connected tournaments.
LAGOS
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
2021 J jnl
Counting orientations of graphs with no strongly connected tournaments.
CoRR
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
2021 J jnl
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees.
SIAM J. Discret. Math.
Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota, Bjarne Schülke
2021 J jnl
Decomposing split graphs into locally irregular graphs.
Discret. Appl. Math.
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli
2020 J jnl
Counting graph orientations with no directed triangles.
CoRR
Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota
2020 J jnl
Counting restricted orientations of random graphs.
Random Struct. Algorithms
Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota
2020 J jnl
The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory B
Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts
2019 C conf
Anti-Ramsey Threshold of Cycles for Sparse Graphs.
LAGOS
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk
2019 J jnl
Counting Gallai 3-colorings of complete graphs.
Discret. Math.
Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau
2019 C conf
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges.
LAGOS
Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato
2019 C conf
Decomposing Split Graphs into Locally Irregular Graphs.
LAGOS
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli
2019 C conf
On Edge-magic Labelings of Forests.
LAGOS
Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee, Carla Negri Lintzmayer, Guilherme Oliveira Mota, Cândida Nunes da Silva
2019 J jnl
On the local density problem for graphs of given odd-girth.
J. Graph Theory
Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht
2019 J jnl
Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
Random Struct. Algorithms
Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota
2019 J jnl
The size?Ramsey number of powers of paths.
J. Graph Theory
Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts
2019 J jnl
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth.
SIAM J. Discret. Math.
Guilherme Oliveira Mota
2018 J jnl
Decomposing highly connected graphs into paths of length five.
Discret. Appl. Math.
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
2018 J jnl
Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version.
Contributions Discret. Math.
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2018 J jnl
On an anti-Ramsey threshold for sparse graphs with one triangle.
J. Graph Theory
Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
2017 J jnl
Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017 J jnl
Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017 J jnl
Decomposing highly edge-connected graphs into paths of any given length.
J. Comb. Theory B
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
2017 J jnl
Decomposing regular graphs with prescribed girth into paths of given length.
Eur. J. Comb.
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
2017 J jnl
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version.
SIAM J. Discret. Math.
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2017 J jnl
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version.
Electron. Notes Discret. Math.
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2017 J jnl
Monochromatic trees in random graphs.
Electron. Notes Discret. Math.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
2017 J jnl
On the local density problem for graphs of given odd-girth.
Electron. Notes Discret. Math.
Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht
2017 J jnl
On the number of r-transitive orientations of G(n, p).
Electron. Notes Discret. Math.
Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota
2016 J jnl
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version.
Electron. Notes Discret. Math.
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg
2015 J jnl
A counting lemma for sparse pseudorandom hypergraphs.
Electron. Notes Discret. Math.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2015 J jnl
Decompositions of highly connected graphs into paths of any given length.
Electron. Notes Discret. Math.
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
2015 J jnl
Decompositions of highly connected graphs into paths of length five.
Electron. Notes Discret. Math.
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
2015 J jnl
Decompositions of triangle-free 5-regular graphs into paths of length five.
Discret. Math.
Fábio Botler, Guilherme Oliveira Mota, Yoshiko Wakabayashi
2015 J jnl
Path decompositions of regular graphs with prescribed girth.
Electron. Notes Discret. Math.
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
2015 J jnl
Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb.
Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz
2014 C conf
Network-Based Disease Gene Prioritization by Hitting Time Analysis.
BIBE
Leandro de A. Lima, Sérgio Nery Simões, Ronaldo Fumio Hashimoto, David Correa Martins Jr., Helena Paula Brentani, Guilherme Oliveira Mota
2014 J jnl
On an anti-Ramsey threshold for random graphs.
Eur. J. Comb.
Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
2014 J jnl
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.
Electron. J. Comb.
Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente
2013 — —
Two problems in modern combinatorics.
Guilherme Oliveira Mota
2011 J jnl
A note on counting orientations.
Electron. Notes Discret. Math.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente
2011 J jnl
On an anti-Ramsey property of random graphs.
Electron. Notes Discret. Math.
Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota