Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
Authors:
- Noga AlonNANoga Alon
- Alexey PokrovskiyAPAlexey Pokrovskiy
- Benny SudakovBSBenny Sudakov
- 1 October 2017
- journal article
- research article
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 222 (1) , 317-331
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Properly colored and rainbow copies of graphs with few cherriesJournal of Combinatorial Theory, Series B, 2017
- Rainbow and orthogonal paths in factorizations of KnJournal of Combinatorial Designs, 2010
- A lower bound for the length of a partial transversal in a Latin squareJournal of Combinatorial Theory, Series A, 2008
- Counting Sets With Small Sumset, And The Clique Number Of Random Cayley GraphsCombinatorica, 2005
- Concentration1998
- Repeated communication and Ramsey graphsIEEE Transactions on Information Theory, 1995
- Hamilton circuits with many colours in properly edge-coloured complete graphs.MATHEMATICA SCANDINAVICA, 1989
- Path and cycle sub-ramsey numbers and an edge-colouring conjectureDiscrete Mathematics, 1986
- One‐factorizations of the complete graph—A surveyJournal of Graph Theory, 1985
- On a problem of G. Hahn about coloured hamiltonian paths in K2tDiscrete Mathematics, 1984