Guilherme Oliveira Mota

Electron. J. Comb., 2024

Separating Path Systems in Complete Graphs.

[BibT_eX]

[DOI]

Cristina G. Fernandes

Nicolás Sanhueza-Matamala

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

The anti-Ramsey threshold of complete graphs.

[BibT_eX]

[DOI]

Olaf Parczyk

Discret. Math., May, 2023

Resilience for loose Hamilton cycles.

[BibT_eX]

[DOI]

José D. Alvarado

Richard Lang

Henrique Stagni

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A canonical Ramsey theorem with list constraints in random graphs.

[BibT_eX]

[DOI]

José D. Alvarado

Patrick Morris

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Factors in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

Counting orientations of graphs with no strongly connected tournaments.

[BibT_eX]

[DOI]

Carlos Hoppen

Bruno Pasqualotto Cavalar

Discret. Math., 2022

Anti-Ramsey threshold of cycles.

[BibT_eX]

[DOI]

Gabriel Ferreira Barros

Olaf Parczyk

Discret. Appl. Math., 2022

2021

Covering 3-Edge-Colored Random Graphs with Monochromatic Trees.

[BibT_eX]

[DOI]

Walner Mendonça

Bjarne Schülke

SIAM J. Discret. Math., 2021

Constrained colourings of random graphs.

[BibT_eX]

[DOI]

Maurício Collares Neto

Carlos Gustavo T. de A. Moreira

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Counting restricted orientations of random graphs.

[BibT_eX]

[DOI]

Maurício Collares Neto

Robert Morris

Random Struct. Algorithms, July, 2020

The multicolour size-Ramsey number of powers of paths.

[BibT_eX]

[DOI]

Jie Han

Matthew Jenssen

Barnaby Roberts

J. Comb. Theory, Ser. B, 2020

Counting graph orientations with no directed triangles.

[BibT_eX]

[DOI]

Pedro Araújo

CoRR, 2020

2019

Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

Wiebke Bedenknecht

Jie Han

Random Struct. Algorithms, 2019

The size?Ramsey number of powers of paths.

[BibT_eX]

[DOI]

Damian Reding

Barnaby Roberts

J. Graph Theory, 2019

Decomposing Split Graphs into Locally Irregular Graphs.

[BibT_eX]

[DOI]

Carla Negri Lintzmayer

Maycon Sambinelli

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.

[BibT_eX]

[DOI]

Carlos Hoppen

Roberto F. Parente

Cristiane M. Sato

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Edge-magic Labelings of Forests.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Cristina G. Fernandes

Orlando Lee

Carla Negri Lintzmayer

Bruno Pasqualotto Cavalar

Cândida Nunes da Silva

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Anti-Ramsey Threshold of Cycles for Sparse Graphs.

[BibT_eX]

[DOI]

Gabriel Ferreira Barros

Olaf Parczyk

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Counting Gallai 3-colorings of complete graphs.

[BibT_eX]

[DOI]

Fabrício Siqueira Benevides

Ignasi Sau

Discret. Math., 2019

2018

On an anti-Ramsey threshold for sparse graphs with one triangle.

[BibT_eX]

[DOI]

P. B. Konstadinidis

J. Graph Theory, 2018

Decomposing highly connected graphs into paths of length five.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version.

[BibT_eX]

[DOI]

Fabian Schulenburg

SIAM J. Discret. Math., 2017

Decomposing highly edge-connected graphs into paths of any given length.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2017

On the number of r-transitive orientations of G(n, p).

[BibT_eX]

[DOI]

Maurício Collares Neto

Robert Morris

Electron. Notes Discret. Math., 2017

Monochromatic trees in random graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On the local density problem for graphs of given odd-girth.

[BibT_eX]

[DOI]

Wiebke Bedenknecht

Christian Reiher

Electron. Notes Discret. Math., 2017

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version.

[BibT_eX]

[DOI]

Fabian Schulenburg

Electron. Notes Discret. Math., 2017

Counting results for sparse pseudorandom hypergraphs II.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Decomposing regular graphs with prescribed girth into paths of given length.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

2016

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version.

[BibT_eX]

[DOI]

Fabian Schulenburg

Electron. Notes Discret. Math., 2016

2015

A counting lemma for sparse pseudorandom hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of length five.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of any given length.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Path decompositions of regular graphs with prescribed girth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Ramsey numbers for bipartite graphs with small bandwidth.

[BibT_eX]

[DOI]

Gábor N. Sárközy

Eur. J. Comb., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

On an anti-Ramsey threshold for random graphs.

[BibT_eX]

[DOI]

P. B. Konstadinidis

Eur. J. Comb., 2014

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.

[BibT_eX]

[DOI]

Peter Allen

Roberto F. Parente

Electron. J. Comb., 2014

Network-Based Disease Gene Prioritization by Hitting Time Analysis.

[BibT_eX]

[DOI]

Leandro de A. Lima

Sérgio Nery Simões

Ronaldo Fumio Hashimoto

David Correa Martins Jr.

Helena Paula Brentani

Proceedings of the 2014 IEEE International Conference on Bioinformatics and Bioengineering, 2014

2013

Two problems in modern combinatorics.

[BibT_eX]

[DOI]

PhD thesis, 2013

2011

A note on counting orientations.

[BibT_eX]

[DOI]

Roberto F. Parente

Electron. Notes Discret. Math., 2011

On an anti-Ramsey property of random graphs.

[BibT_eX]

[DOI]

P. B. Konstadinidis