论文信息 - Multicoloured Hamilton Cycles - 字舞流文

Multicoloured Hamilton Cycles

The edges of the complete graph $K_n$ are coloured so that no colour appears more than $\lceil cn\rceil$ times, where $c

Alan M. Frieze | Bruce A. Reed | Michael H. Albert | B. Reed | A. Frieze | M. Albert

[1] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[2] Carsten Thomassen,et al. Path and cycle sub-ramsey numbers and an edge-colouring conjecture , 1986, Discret. Math..

[3] Paul Erdös,et al. Lopsided Lovász Local Lemma and Latin transversals , 1991, Discret. Appl. Math..

[4] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5] Alan M. Frieze,et al. Polychromatic Hamilton cycles , 1993, Discret. Math..