1 citations · 1 across the 5 of their papers we have counts for
6 papers
Almost perfect graph classes
Cicely Henderson, Hidde Koerts, Taite LaGrange +4
A graph is perfect if for each induced subgraph of . In 2002, Chudnovsky, Robertson, Seymour, and Thomas famously proved the Strong Perfect Graph Theorem.…
On the Hypergraph Nash-Williams' Conjecture
Cicely Henderson, Luke Postle
In 2014, Keevash proved the existence of -Steiner systems (equivalently -decompositions of ) for all large enough satisfying the necessary divisibility c…
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…
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…
Hamilton cycles in regular graphs perturbed by a random 2-factor
Cicely, Henderson, Sean Longbrake +2
In this paper, we prove that for each , the union of a -regular graph with a uniformly random -factor on the same vertex set is Hamiltonian with high probability. T…
Maximum -colourable induced subgraphs in -free graphs
Cicely Henderson, Evelyne Smith-Roberge, Sophie Spirkl +1
We show that for any nonnegative integer , the Weighted Maximum List--Colourable Induced Subgraph problem can be solved in polynomial time for input graphs that do not contai…