Подписаться
Guilherme Oliveira Mota
Guilherme Oliveira Mota
Подтвержден адрес электронной почты в домене ime.usp.br - Главная страница
Название
Процитировано
Процитировано
Год
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
W Bedenknecht, J Han, Y Kohayakawa, GO Mota
Random Structures & Algorithms 55 (4), 795-807, 2019
402019
Decomposing highly edge-connected graphs into paths of any given length
F Botler, GO Mota, MTI Oshiro, Y Wakabayashi
Journal of Combinatorial Theory, Series B 122, 508-542, 2017
272017
Loose Hamiltonian Cycles Forced by Large -Degree---Approximate Version
J de Oliveira Bastos, GO Mota, M Schacht, J Schnitzer, F Schulenburg
SIAM Journal on Discrete Mathematics 31 (4), 2328-2347, 2017
262017
The size‐Ramsey number of powers of paths
D Clemens, M Jenssen, Y Kohayakawa, N Morrison, GO Mota, D Reding, ...
Journal of graph theory 91 (3), 290-299, 2019
252019
The multicolour size-Ramsey number of powers of paths
J Han, M Jenssen, Y Kohayakawa, GO Mota, B Roberts
Journal of Combinatorial Theory, Series B 145, 359-375, 2020
222020
The size‐Ramsey number of powers of bounded degree trees
S Berger, Y Kohayakawa, GS Maesaka, T Martins, W Mendonça, GO Mota, ...
Journal of the London Mathematical Society 103 (4), 1314-1332, 2021
192021
On an anti-Ramsey threshold for random graphs
Y Kohayakawa, PB Konstadinidis, GO Mota
European Journal of Combinatorics 40, 26-41, 2014
192014
Loose Hamiltonian cycles forced by large (k-2)-degree-sharp version
JO Bastos, GO Mota, M Schacht, J Schnitzer, F Schulenburg
Contributions to Discrete Mathematics 13 (2), 88, 2018
182018
Decompositions of triangle-free 5-regular graphs into paths of length five
F Botler, GO Mota, Y Wakabayashi
Discrete Mathematics 338 (11), 1845-1855, 2015
182015
Monochromatic trees in random graphs
Y Kohayakawa, GO Mota, M Schacht
Mathematical Proceedings of the Cambridge Philosophical Society 166 (1), 191-208, 2019
172019
On an anti‐Ramsey threshold for sparse graphs with one triangle
Y Kohayakawa, PB Konstadinidis, GO Mota
Journal of Graph Theory 87 (2), 176-187, 2018
152018
Counting Gallai 3-colorings of complete graphs
J de Oliveira Bastos, FS Benevides, GO Mota, I Sau
Discrete Mathematics 342 (9), 2618-2631, 2019
132019
The size-Ramsey number of 3-uniform tight paths
J Han, Y Kohayakawa, S Letzter, GO Mota, O Parczyk
arXiv preprint arXiv:1907.08086, 2019
112019
Decompositions of highly connected graphs into paths of length five
F Botler, GO Mota, MTI Oshiro, Y Wakabayashi
Electronic Notes in Discrete Mathematics 50, 211-216, 2015
112015
Decomposing split graphs into locally irregular graphs
CN Lintzmayer, GO Mota, M Sambinelli
Discrete Applied Mathematics 292, 33-44, 2021
92021
On the local density problem for graphs of given odd‐girth
W Bedenknecht, GO Mota, C Reiher, M Schacht
Journal of Graph Theory 90 (2), 137-149, 2019
92019
Decomposing highly connected graphs into paths of length five
F Botler, GO Mota, MTI Oshiro, Y Wakabayashi
Discrete Applied Mathematics 245, 128-138, 2018
92018
Ramsey numbers for bipartite graphs with small bandwidth
GO Mota, GN Sárközy, M Schacht, A Taraz
European journal of combinatorics 48, 165-176, 2015
92015
Path decompositions of regular graphs with prescribed girth
F Botler, GO Mota, MTI Oshiro, Y Wakabayashi
Electronic Notes in Discrete Mathematics 49, 629-636, 2015
82015
Factors in randomly perturbed hypergraphs
Y Chang, J Han, Y Kohayakawa, P Morris, GO Mota
Random Structures & Algorithms 60 (2), 153-165, 2022
72022
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20