1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
Improving the Caro-Wei bound and applications to Turán stability
Tom Kelly, Luke Postle
We prove that if is a graph and for each , then either has an independent set of size at least or contains…
Thresholds for -Steiner Systems via Refined Absorption
Michelle Delcourt, Tom Kelly, Luke Postle
We prove that if , then asymptotically almost surely the binomial random -uniform hypergraph contains an -Steiner system, provided $…
Clique Decompositions in Random Graphs via Refined Absorption
Michelle Delcourt, Tom Kelly, Luke Postle
We prove that if for some , then asymptotically almost surely the binomial random graph has a -packing containing all but at most $n +…