论文信息 - On Rainbow Trees and Cycles - 字舞流文

On Rainbow Trees and Cycles

We derive sufficient conditions for the existence of rainbow cycles of all lengths in edge colourings of complete graphs. We also consider rainbow colorings of a certain class of trees.

Alan M. Frieze | Michael Krivelevich

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

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

[3] Alan M. Frieze,et al. Multicoloured Hamilton Cycles , 1995, Electron. J. Comb..

[4] Noga Alon,et al. Embedding nearly-spanning bounded degree trees , 2007, Comb..

[5] Alan M. Frieze,et al. Perfect matchings in random graphs with prescribed minimal degree , 2003, SODA '03.

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

[7] Simmy Bank. Comment 1 , 1990 .