Academic paper
A minimum-degree threshold for colour-biased Hamilton cycles in hypergraphs
Abstract
We determine the asymptotically best possible minimum vertex degree condition forcing a two-coloured $3$-graph to contain a colour-biased tight Hamilton cycle. This confirms a conjecture of H\`an, Lang, Marciano, Pavez-Sign\'e, Sanhueza-Matamala, Treglown and Z\'arate-Guer\'en.
This public page contains bibliographic metadata and the author abstract. Use the reader for licensed document access.
Open licensed paper reader