论文信息 - Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs

Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs

We define a space of random edge-coloured graphs Gn,m,κ which correspond naturally to edge κ-colourings of Gn,m. We show that there exist constants K0, K1 ≤ 21 such that, provided m ≥ K0n log n and κ ≥ K1n, then a random edge-coloured graph contains a multi-coloured Hamilton cycle with probability tending to 1 as the number of vertices n tends to infinity.

Alan M. Frieze | Colin Cooper | A. Frieze | C. Cooper

[1] Simmy Bank. Comment 1 , 1990 .

[2] Alan M. Frieze,et al. Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold , 1995, Electron. J. Comb..

[3] Colin Cooper,et al. Hamilton cycles in random graphs and directed graphs , 2000 .

[4] Alan M. Frieze,et al. Multicolored Trees in Random Graphs , 1994, Random Struct. Algorithms.

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

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

[7] Alan M. Frieze,et al. Hamilton Cycles in a Class of Random Directed Graphs , 1994, J. Comb. Theory, Ser. B.