default search action
Guilherme Oliveira Mota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Pedro Araújo, Taísa Martins, Letícia Mattos, Walner Mendonça, Luiz Moreira, Guilherme Oliveira Mota:
On the Anti-Ramsey Threshold for Non-Balanced Graphs. Electron. J. Comb. 31(1) (2024) - [j38]Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa
, Guilherme Oliveira Mota
Directed graphs with lower orientation Ramsey thresholds. RAIRO Oper. Res. 58(4): 3607-3619 (2024) - [j37]Marcelo Campos, Maurício Collares Neto
Counting orientations of random graphs with no directed k-cycles. Random Struct. Algorithms 64(3): 676-691 (2024) - [c10]Cristina G. Fernandes
Separating Path Systems in Complete Graphs. LATIN (2) 2024: 98-113 - 2023
- [j36]Yoshiharu Kohayakawa
The anti-Ramsey threshold of complete graphs. Discret. Math. 346(5): 113343 (2023) - [c9]José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris
A canonical Ramsey theorem with list constraints in random graphs. LAGOS 2023: 13-19 - [c8]José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni:
Resilience for loose Hamilton cycles. LAGOS 2023: 193-200 - 2022
- [j35]Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar
Anti-Ramsey threshold of cycles. Discret. Appl. Math. 323: 228-235 (2022) - [j34]Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. Discret. Math. 345(12): 113024 (2022) - [j33]Yulin Chang, Jie Han, Yoshiharu Kohayakawa
Factors in randomly perturbed hypergraphs. Random Struct. Algorithms 60(2): 153-165 (2022) - 2021
- [j32]Carla Negri Lintzmayer
Decomposing split graphs into locally irregular graphs. Discret. Appl. Math. 292: 33-44 (2021) - [j31]Yoshiharu Kohayakawa
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees. SIAM J. Discret. Math. 35(2): 1447-1459 (2021) - [c7]Maurício Collares Neto, Yoshiharu Kohayakawa
Constrained colourings of random graphs. LAGOS 2021: 368-375 - [c6]Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. LAGOS 2021: 385-393 - [i2]Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota:
Counting orientations of graphs with no strongly connected tournaments. CoRR abs/2101.12327 (2021) - 2020
- [j30]Jie Han, Matthew Jenssen
The multicolour size-Ramsey number of powers of paths. J. Comb. Theory B 145: 359-375 (2020) - [j29]Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota
Counting restricted orientations of random graphs. Random Struct. Algorithms 56(4): 1016-1030 (2020) - [i1]Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota:
Counting graph orientations with no directed triangles. CoRR abs/2005.13091 (2020)
2010 – 2019
- 2019
- [j28]Josefran de Oliveira Bastos, Fabrício Siqueira Benevides
Counting Gallai 3-colorings of complete graphs. Discret. Math. 342(9): 2618-2631 (2019) - [j27]Wiebke Bedenknecht
On the local density problem for graphs of given odd-girth. J. Graph Theory 90(2): 137-149 (2019) - [j26]Dennis Clemens
The size?Ramsey number of powers of paths. J. Graph Theory 91(3): 290-299 (2019) - [j25]Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota
Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Struct. Algorithms 55(4): 795-807 (2019) - [j24]Guilherme Oliveira Mota
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth. SIAM J. Discret. Math. 33(1): 197-208 (2019) - [c5]Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar
Anti-Ramsey Threshold of Cycles for Sparse Graphs. LAGOS 2019: 89-98 - [c4]Márcia R. Cerioli, Cristina G. Fernandes
On Edge-magic Labelings of Forests. LAGOS 2019: 299-307 - [c3]Carlos Hoppen
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. LAGOS 2019: 535-544 - [c2]Carla Negri Lintzmayer
Decomposing Split Graphs into Locally Irregular Graphs. LAGOS 2019: 603-612 - 2018
- [j23]Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg:
Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version. Contributions Discret. Math. 13(2) (2018) - [j22]Fábio Botler
Decomposing highly connected graphs into paths of length five. Discret. Appl. Math. 245: 128-138 (2018) - [j21]Yoshiharu Kohayakawa
On an anti-Ramsey threshold for sparse graphs with one triangle. J. Graph Theory 87(2): 176-187 (2018) - 2017
- [j20]Yoshiharu Kohayakawa
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65: 276-287 (2017) - [j19]Yoshiharu Kohayakawa
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65: 288-301 (2017) - [j18]Fábio Botler
Decomposing regular graphs with prescribed girth into paths of given length. Eur. J. Comb. 66: 28-36 (2017) - [j17]Josefran de Oliveira Bastos, Guilherme Oliveira Mota
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. Electron. Notes Discret. Math. 61: 101-106 (2017) - [j16]Maurício Collares Neto, Yoshiharu Kohayakawa
On the number of r-transitive orientations of G(n, p). Electron. Notes Discret. Math. 61: 255-261 (2017) - [j15]Yoshiharu Kohayakawa
Monochromatic trees in random graphs. Electron. Notes Discret. Math. 61: 759-764 (2017) - [j14]Wiebke Bedenknecht, Guilherme Oliveira Mota
On the local density problem for graphs of given odd-girth. Electron. Notes Discret. Math. 62: 39-44 (2017) - [j13]Fábio Botler
Decomposing highly edge-connected graphs into paths of any given length. J. Comb. Theory B 122: 508-542 (2017) - [j12]Josefran de Oliveira Bastos, Guilherme Oliveira Mota
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. SIAM J. Discret. Math. 31(4): 2328-2347 (2017) - 2016
- [j11]Josefran de Oliveira Bastos, Guilherme Oliveira Mota
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version. Electron. Notes Discret. Math. 54: 325-330 (2016) - 2015
- [j10]Fábio Botler
Decompositions of triangle-free 5-regular graphs into paths of length five. Discret. Math. 338(11): 1845-1855 (2015) - [j9]Guilherme Oliveira Mota
Ramsey numbers for bipartite graphs with small bandwidth. Eur. J. Comb. 48: 165-176 (2015) - [j8]Fábio Botler
Path decompositions of regular graphs with prescribed girth. Electron. Notes Discret. Math. 49: 629-636 (2015) - [j7]Fábio Botler
Decompositions of highly connected graphs into paths of any given length. Electron. Notes Discret. Math. 49: 795-802 (2015) - [j6]Fábio Botler
Decompositions of highly connected graphs into paths of length five. Electron. Notes Discret. Math. 50: 211-216 (2015) - [j5]Yoshiharu Kohayakawa
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50: 421-426 (2015) - 2014
- [j4]Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente:
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. Electron. J. Comb. 21(1): 1 (2014) - [j3]Yoshiharu Kohayakawa
On an anti-Ramsey threshold for random graphs. Eur. J. Comb. 40: 26-41 (2014) - [c1]Leandro de A. Lima, Sérgio Nery Simões, Ronaldo Fumio Hashimoto
Network-Based Disease Gene Prioritization by Hitting Time Analysis. BIBE 2014: 9-14 - 2013
- [b1]Guilherme Oliveira Mota:
Two problems in modern combinatorics. University of São Paulo, Brazil, 2013 - 2011
- [j2]Yoshiharu Kohayakawa
A note on counting orientations. Electron. Notes Discret. Math. 37: 3-8 (2011) - [j1]Yoshiharu Kohayakawa
On an anti-Ramsey property of random graphs. Electron. Notes Discret. Math. 37: 237-242 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: