G. O. Mota

From MaRDI portal
Person:2091803

Available identifiers

zbMath Open mota.guilherme-oliveiraDBLP204/5903WikidataQ105708456 ScholiaQ105708456MaRDI QIDQ2091803

List of research outcomes





PublicationDate of PublicationType
Directed graphs with lower orientation Ramsey thresholds2025-01-08Paper
The size-Ramsey number of powers of bounded degree trees2024-10-18Paper
Covering 3-coloured random graphs with monochromatic trees2024-10-18Paper
On the anti-Ramsey threshold for non-balanced graphs2024-04-18Paper
Counting orientations of random graphs with no directed k‐cycles2024-03-25Paper
Separating path systems in complete graphs2023-12-22Paper
Factors in randomly perturbed hypergraphs2023-10-12Paper
Resilience for Loose Hamilton Cycles2023-09-25Paper
A canonical Ramsey theorem with list constraints in random graphs2023-04-04Paper
https://portal.mardi4nfdi.de/entity/Q58845952023-03-23Paper
The anti-Ramsey threshold of complete graphs2023-03-10Paper
Directed graphs with lower orientation Ramsey thresholds2022-11-13Paper
Anti-Ramsey threshold of cycles2022-11-02Paper
Counting orientations of graphs with no strongly connected tournaments2022-09-26Paper
The threshold for the constrained Ramsey property2022-07-11Paper
Decomposing split graphs into locally irregular graphs2022-04-27Paper
Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges2022-04-27Paper
On edge-magic labelings of forests2022-04-27Paper
Anti-Ramsey threshold of cycles for sparse graphs2022-04-27Paper
The size-Ramsey number of 3-uniform tight paths2021-11-05Paper
The size‐Ramsey number of powers of bounded degree trees2021-08-13Paper
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees2021-06-28Paper
On the local density problem for graphs of given odd-girth2021-06-25Paper
Decomposing split graphs into locally irregular graphs2021-02-01Paper
Counting restricted orientations of random graphs2020-10-26Paper
The multicolour size-Ramsey number of powers of paths2020-09-24Paper
Counting graph orientations with no directed triangles2020-05-26Paper
Powers of tight Hamilton cycles in randomly perturbed hypergraphs2020-02-14Paper
The size‐Ramsey number of powers of paths2019-08-15Paper
Counting Gallai 3-colorings of complete graphs2019-07-18Paper
Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version2019-03-05Paper
The anti-Ramsey threshold of complete graphs2019-02-01Paper
Monochromatic trees in random graphs2019-01-31Paper
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth2019-01-23Paper
Decomposing highly connected graphs into paths of length five2018-05-24Paper
On the local density problem for graphs of given odd-girth2018-04-09Paper
On an anti‐Ramsey threshold for sparse graphs with one triangle2018-02-23Paper
Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version2018-01-18Paper
Monochromatic trees in random graphs2018-01-18Paper
On the number of \(r\)-transitive orientations of \(G(n,p)\)2018-01-18Paper
Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version2017-10-24Paper
Decomposing regular graphs with prescribed girth into paths of given length2017-09-11Paper
Counting results for sparse pseudorandom hypergraphs. I.2017-08-31Paper
Counting results for sparse pseudorandom hypergraphs. II.2017-08-31Paper
Edge-magic labelings for constellations and armies of caterpillars2017-08-15Paper
Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version2017-02-13Paper
Decomposing highly edge-connected graphs into paths of any given length2016-11-25Paper
Decompositions of highly connected graphs into paths of length five2016-10-17Paper
A counting lemma for sparse pseudorandom hypergraphs2016-10-17Paper
Path decompositions of regular graphs with prescribed girth2016-10-14Paper
Decompositions of highly connected graphs into paths of any given length2016-10-14Paper
Decompositions of triangle-free 5-regular graphs into paths of length five2015-06-29Paper
Ramsey numbers for bipartite graphs with small bandwidth2015-06-02Paper
On the number of orientations of random graphs with no directed cycles of a given length2014-09-04Paper
On an anti-Ramsey threshold for random graphs2014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54199602014-06-11Paper
A note on counting orientations2013-07-23Paper
On an anti-Ramsey property of random graphs2013-07-23Paper

Research outcomes over time

This page was built for person: G. O. Mota