Jozef Skokan

most citedA robust CorrÃ¡di--Hajnal Theorem

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2026

Breaking the Bollobás-Eldridge-Catlin Barrier for Bipartite Graphs

Peter Allen, Julia BÃ¶ttcher, Julia Böttcher +2

The celebrated Bollobás-Eldridge-Catlin packing conjecture states that every $n$ -vertex graph $G$ with minimum degree at least $(1 - \frac{1}{Δ + 1}) n$ contains every $n$ -vert…

math.CO2026★ 1 cited

A robust CorrÃ¡di--Hajnal Theorem

Peter Allen, Julia BÃ¶ttcher, Jan Corsten +5

For a graph $G$ and $p \in [0, 1]$ , we denote by $G_{p}$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$ . We show that there ex…