Jared León

activity

20242026

collaborators

9 papers

math.CO2026

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…

math.CO2026

The inducibility of 6-vertex graphs

Levente Bodnár, Jun Gao, Jared León +3

The inducibility constant $λ_{F}$ of a graph $F$ is the asymptotically maximum induced density of $F$ in a growing sequence of graphs. This paper systematically investigates the ca…

math.CO2025

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 $n$ -vertex graph with minimum degree at least $\frac{n}{2}$ contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was sh…

math.CO2025

The Turán density of short tight cycles

Levente Bodnár, Jared León, Xizhi Liu +1

The $3$ -uniform tight $ℓ$ -cycle $C_{ℓ}^{3}$ is the $3$ -graph on ${1, \dots, ℓ}$ consisting of all $ℓ$ consecutive triples in the cyclic order. Let $C$ be either…

math.CO2025

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…

math.CO2024

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 $C_{ℓ}^{3 -}$ be the $3$ -graph on ${1, \dots, ℓ}$ consisting of $ℓ - 1$ consecutive triples in the cyclic order. We show that, for eve…

math.CO2024

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…

math.CO2024

On cospectral graphons

Jan Hladký, Daniel Iľkovič, Jared León +1

In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectr…

math.CO2024

Nondegenerate Turán problems under $(t, p)$ -norms

Wanfang Chen, Daniel Iľkovič, Jared León +2

Given integers $r > t \geq 1$ and a real number $p > 0$ , the $(t, p)$ -norm $∥ H ∥_{t, p}$ of an $r$ -graph $H$ is the sum of the $p$ -th power o…

Arithmetic progressions in a random set on a budget

The inducibility of 6-vertex graphs

Colour-biased Hamilton cycles in dense graphs and random graphs

The Turán density of short tight cycles

A Recolouring Version of a Conjecture of Reed

The Turán density of the tight 5-cycle minus one edge

Multi-cyclic graphs in the random graph process with restricted budget

On cospectral graphons

Nondegenerate Turán problems under (t,p)-norms

Nondegenerate Turán problems under $(t, p)$ -norms