Leo Versteegen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers Journal of Combinatorial Theory. Series B	2026-02-09	Paper
Decay-Ramsey Sequences (available as arXiv preprint)	2026-01-01	Paper
Packing paths in sparse random graphs Random Structures & Algorithms	2025-08-29	Paper
Upper bounds for linear graph codes Random Structures & Algorithms	2025-02-14	Paper
A proof of the 3/4-conjecture for the total domination game SIAM Journal on Discrete Mathematics	2025-01-22	Paper
The sandglass conjecture beyond cancellative pairs (available as arXiv preprint)	2025-01-01	Paper
Relative Turán densities for ordered graphs: all and nothing (available as arXiv preprint)	2025-01-01	Paper
Embedding trees using minimum and maximum degree conditions (available as arXiv preprint)	2025-01-01	Paper
The structure of large sum-free sets in \(\mathbb{F}^n_p\) The Quarterly Journal of Mathematics	2024-10-31	Paper
A proof of the 3/5-conjecture in the domination game European Journal of Combinatorics	2024-09-30	Paper
A note on interval colourings of graphs European Journal of Combinatorics	2024-07-08	Paper
On the number of minimum dominating sets and total dominating sets in forests Journal of Graph Theory	2024-07-02	Paper
An exploration of the balance game (available as arXiv preprint)	2024-01-01	Paper
Packing and finding paths in sparse random graphs (available as arXiv preprint)	2024-01-01	Paper
A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers (available as arXiv preprint)	2024-01-01	Paper
On interval colourings of graphs (available as arXiv preprint)	2023-01-01	Paper
Strongly common graphs with odd girth are cycles (available as arXiv preprint)	2023-01-01	Paper

Research outcomes over time

This page was built for person: Leo Versteegen