A note on colour-bias Hamilton cycles in dense graphs
Combinatorics
2021-03-05 v2
Abstract
Balogh, Csaba, Jing and Pluh\'ar recently determined the minimum degree threshold that ensures a -coloured graph contains a Hamilton cycle of significant colour bias (i.e., a Hamilton cycle that contains significantly more than half of its edges in one colour). In this short note we extend this result, determining the corresponding threshold for -colourings.
Cite
@article{arxiv.2011.03948,
title = {A note on colour-bias Hamilton cycles in dense graphs},
author = {Andrea Freschi and Joseph Hyde and Joanna Lada and Andrew Treglown},
journal= {arXiv preprint arXiv:2011.03948},
year = {2021}
}
Comments
6 pages, 2 figures. Author accepted manuscript, to appear in the SIAM Journal on Discrete Mathematics