A minimum-degree threshold for colour-biased Hamilton cycles in hypergraphs
arXiv:2607.29628
Abstract
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 conjecture of Hàn, Lang, Marciano, Pavez-Signé, Sanhueza-Matamala, Treglown and Zárate-Guerén.