activity
20162026
most citedAlmost all 9-regular graphs have a modulo-5 orientation

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

collaborators
Showing math.COShow all

22 papers · 1 filter

math.CO2026

A Proof of Nash-Williams' Conjecture

Michelle Delcourt, Luke Postle

A central open question in extremal design theory is Nash-Williams' Conjecture from 1970 that every triangle-divisible graph on vertices (for large enough) with minimum deg…

math.CO2025

Fractional Clique Decompositions of Dense Hypergraphs

Michelle Delcourt, Thomas Lesgourgues, Luke Postle

In 2014, Keevash famously proved the existence of -Steiner systems as part of settling the Existence Conjecture of Combinatorial Designs (dating from the mid-1800s). In 20…

math.CO2025

Beyond Nash-Williams: Counterexamples to Clique Decomposition Thresholds for All Cliques Larger than Triangles

Michelle Delcourt, Cicely Henderson, Thomas Lesgourgues +1

A central open question in extremal design theory is Nash-Williams' Conjecture from 1970 that every -divisible graph on vertices (for large enough) with minimum degree…

math.CO2025

Erdős meets Nash-Williams

Michelle Delcourt, Cicely, Henderson +2

In 1847, Kirkman proved that there exists a Steiner triple system on vertices (equivalently a triangle decomposition of the edges of ) whenever satisfies the necessary…

math.CO2024

A Short Proof of the Existence of -absorbers

Michelle Delcourt, Tom Kelly, Luke Postle

We codify a short self-contained proof of the existence of -absorbers implicit in Keevash's original proof of the Existence Conjecture. Combining this with the work of the f…

math.CO2024★ 1 cited

Sunflowers in set systems with small VC-dimension

József Balogh, Anton Bernshteyn, Michelle Delcourt +2

A family of distinct sets is an -sunflower if for all and , we have $A_i \cap A_j = A_…