Guilherme Oliveira Mota

According to our database1, Guilherme Oliveira Mota authored at least 34 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory, Ser. B, 2020

Counting graph orientations with no directed triangles.
CoRR, 2020

2019
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth.
SIAM J. Discret. Math., 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
Random Struct. Algorithms, 2019

The size?Ramsey number of powers of paths.
J. Graph Theory, 2019

Decomposing Split Graphs into Locally Irregular Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Edge-magic Labelings of Forests.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Anti-Ramsey Threshold of Cycles for Sparse Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Counting Gallai 3-colorings of complete graphs.
Discret. Math., 2019

2018
On an anti-Ramsey threshold for sparse graphs with one triangle.
J. Graph Theory, 2018

Decomposing highly connected graphs into paths of length five.
Discret. Appl. Math., 2018

2017
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version.
SIAM J. Discret. Math., 2017

Decomposing highly edge-connected graphs into paths of any given length.
J. Comb. Theory, Ser. B, 2017

On the number of r-transitive orientations of G(n, p).
Electron. Notes Discret. Math., 2017

Monochromatic trees in random graphs.
Electron. Notes Discret. Math., 2017

On the local density problem for graphs of given odd-girth.
Electron. Notes Discret. Math., 2017

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version.
Electron. Notes Discret. Math., 2017

Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb., 2017

Decomposing regular graphs with prescribed girth into paths of given length.
Eur. J. Comb., 2017

2016
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version.
Electron. Notes Discret. Math., 2016

2015
A counting lemma for sparse pseudorandom hypergraphs.
Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of length five.
Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of any given length.
Electron. Notes Discret. Math., 2015

Path decompositions of regular graphs with prescribed girth.
Electron. Notes Discret. Math., 2015

Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.
Discret. Math., 2015

2014
On an anti-Ramsey threshold for random graphs.
Eur. J. Comb., 2014

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.
Electron. J. Comb., 2014

Network-Based Disease Gene Prioritization by Hitting Time Analysis.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Bioengineering, 2014

2013
Two problems in modern combinatorics.
PhD thesis, 2013

2011
A note on counting orientations.
Electron. Notes Discret. Math., 2011

On an anti-Ramsey property of random graphs.
Electron. Notes Discret. Math., 2011


  Loading...