Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles

[1]  Noga Alon,et al.  Testing triangle-freeness in general graphs , 2006, SODA '06.

[2]  Ben Green.  Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs , 2005, Comb..

[3]  Frank Mousset,et al.  On Rainbow Cycles and Paths , 2012, ArXiv.

[4]  Mehdi Mhalla,et al.  Rainbow and orthogonal paths in factorizations of Kn , 2010 .

[5]  Pooya Hatami,et al.  A lower bound for the length of a partial transversal in a Latin square , 2008, J. Comb. Theory, Ser. A.

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

[7]  Saieed Akbari,et al.  On Rainbow Cycles in Edge Colored Complete Graphs , 2003 .

[8]  Jan Volec,et al.  Properly colored and rainbow copies of graphs with few cherries , 2015, Electron. Notes Discret. Math..

[9]  Xueliang Li,et al.  Long rainbow path in properly edge-colored complete graphs , 2015, 1503.04516.

[10]  Lars Døvling Andersen.  Hamilton circuits with many colours in properly edge-coloured complete graphs. , 1989 .

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

[12]  C. McDiarmid.  Concentration , 1862, The Dental register.

[13]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[14]  Noga Alon,et al.  Repeated communication and Ramsey graphs , 1995, IEEE Trans. Inf. Theory.

[15]  P. Hansen,et al.  Regards sur la théorie des graphes, Actes du colloque de Cerisy 12-18 juin 1980 , 1980 .

[16]  Henry Meyniel,et al.  On a problem of G. Hahn about coloured hamiltonian paths in K2t , 1984, Discret. Math..

[17]  Richard H. Schelp,et al.  Long rainbow cycles in proper edge-colorings of complete graphs , 2011, Australas. J Comb..

[18]  Alexander Rosa,et al.  One-factorizations of the complete graph - A survey , 1985, J. Graph Theory.