4 papers
Perfect tilings of 3-graphs with the generalised triangle
Candida Bowtell, Amarja Kathapurkar, Natasha Morrison +1
We establish a best-possible minimum codegree condition for the existence of a perfect tiling of a -uniform hypergraph with copies of the generalised triangle , which is…
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
Amarja Kathapurkar, Patrick Morris, Guillem Perarnau
A meta-conjecture of Coulson, Keevash, Perarnau and Yepremyan states that above the extremal threshold for a given spanning structure in a (hyper-)graph, one can find a rainbow ver…
Removing induced powers of cycles from a graph via fewest edits
Amarja Kathapurkar, Richard Mycroft
What is the minimum proportion of edges which must be added to or removed from a graph of density to eliminate all induced cycles of length ? The maximum of this quantity ov…
Spanning trees in dense directed graphs
Amarja Kathapurkar, Richard Montgomery
In 2001, Komlós, Sárközy and Szemerédi proved that, for each , there is some and such that, if , then every -vertex graph with minimum degree at leas…