5 papers · 1 filter
Colour-biased Hamilton cycles in dense graphs and random graphs
Natalie Behague, Debsoumya Chakraborti, Jared León
A classical result of Dirac says that every -vertex graph with minimum degree at least contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was sh…
The Turán density of the tight 5-cycle minus one edge
Levente Bodnár, Jared León, Xizhi Liu +1
Let the tight -cycle minus one edge be the -graph on consisting of consecutive triples in the cyclic order. We show that, for eve…
The Turán density of short tight cycles
Levente Bodnár, Jared León, Xizhi Liu +1
The -uniform tight -cycle is the -graph on consisting of all consecutive triples in the cyclic order. Let be either…
Multi-cyclic graphs in the random graph process with restricted budget
Daniel IľkoviÄ, Jared León, Xichao Shu
We study a controlled random graph process introduced by Frieze, Krivelevich, and Michaeli. In this model, the edges of a complete graph are randomly ordered and revealed sequentia…
A Recolouring Version of a Conjecture of Reed
Lucas De Meyer, Clément Legrand-Duchesne, Jared León +2
Reed conjectured that the chromatic number of any graph is closer to its clique number than to its maximum degree plus one. We consider a recolouring version of this conjecture, wi…