8 papers
Arithmetic progressions in a random set on a budget
Jan Hladký, Daniel IľkoviÄ, Jared León +1
A restricted-budget version of the random graph process, introduced by Frieze, Krivelevich, and Michaeli in 2025, studies the construction of structures by an online player who can…
The inducibility of 6-vertex graphs
Levente Bodnár, Jun Gao, Jared León +3
The inducibility constant of a graph is the asymptotically maximum induced density of in a growing sequence of graphs. This paper systematically investigates the c…
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…