论文标题
关于密集图中颜色偏见的汉密尔顿周期的注释
A note on colour-bias Hamilton cycles in dense graphs
论文作者
论文摘要
Balogh，Csaba，Jing和Pluhár最近确定了确保$ 2 $颜色的图形$ G $的最低度阈值包含汉密尔顿颜色偏见的汉密尔顿周期（即汉密尔顿周期，其中包含一半以上一半以上颜色的边缘）。在此简短说明中，我们扩展了此结果，确定了$ r $颜色的相应阈值。
Balogh, Csaba, Jing and Pluhár recently determined the minimum degree threshold that ensures a $2$-coloured graph $G$ 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 $r$-colourings.
