3 papers
math.CO2026
A minimum-degree threshold for colour-biased Hamilton cycles in hypergraphs
Natalie Behague, Felix Christian Clemen, Joseph Hyde +1
We determine the asymptotically best possible minimum vertex degree condition forcing a two-coloured -graph to contain a colour-biased tight Hamilton cycle. This confirms a conj…
math.CO2025
Universality for transversal powers of Hamilton cycles
Emily Heath, Joseph Hyde, Natasha Morrison +1
Let and let be a collection of graphs on a common vertex set of cardinality . We show that if each graph in has minimum degree…
math.CO2025
Thresholds for constrained Ramsey and anti-Ramsey problems
Natalie Behague, Robert Hancock, Joseph Hyde +2
Let and be graphs. A graph has the constrained Ramsey property for if every edge-colouring of contains either a monochromatic copy of or a rai…