Projects per year
Abstract
A kuniform tight cycle is a kgraph with a cyclic order of its vertices such that every k consecutive vertices from an edge. We show that for k≥3, every redblue edgecoloured complete kgraph on n vertices contains k vertexdisjoint monochromatic tight cycles that together cover n−o(n) vertices.
Original language  English 

Journal  Innovations in Graph Theory 
Publication status  Accepted/In press  8 May 2024 
Bibliographical note
Not yet published as of 31/07/2024.Fingerprint
Dive into the research topics of 'Almost partitioning every 2edgecoloured complete kgraph into k monochromatic tight cycles'. Together they form a unique fingerprint.
Ramsey theory: an extremal perspective
Engineering & Physical Science Research Council
1/01/22 → 31/12/24
Project: Research Councils


Matchings and tilings in graphs
Engineering & Physical Science Research Council
1/03/21 → 29/02/24
Project: Research Councils