关注我们：

solidot新版网站常见问题，请点击这里查看。

A Rainbow Dirac's Theorem. (arXiv:1809.06392v1 [math.CO])

来源于:arXiv
A famous theorem of Dirac states that any graph on $n$ vertices with minimum degree at least $n/2$ has a Hamilton cycle. Such graphs are called Dirac graphs. Strengthening this result, we show the existence of rainbow Hamilton cycles in $\mu n$-bounded colourings of Dirac graphs for sufficiently small $\mu >0$. 查看全文>>