6 citations · 9 across the 2 of their papers we have counts for
4 papers
Ringel's tree packing conjecture in quasirandom graphs
Peter Keevash, Katherine Staden
We prove that any quasirandom graph with vertices and edges can be decomposed into copies of any fixed tree with edges. The case of decomposing a complete graph es…
The generalised Oberwolfach problem
Peter Keevash, Katherine Staden
We prove that any quasirandom dense large graph in which all degrees are equal and even can be decomposed into any given collection of two-factors (2-regular spanning subgraphs). A…
The bandwidth theorem for locally dense graphs
Katherine Staden, Andrew Treglown
The Bandwidth theorem of Böttcher, Schacht and Taraz gives a condition on the minimum degree of an -vertex graph that ensures contains every -chromatic graph on $…
On the maximum number of integer colourings with forbidden monochromatic sums
Hong Liu, Maryam Sharifzadeh, Katherine Staden
Let denote the maximum number of colourings of with colours such that each colour class is sum-free. Here, a sum is a subset $\…