✳flâneur — a map of the web's best reading

random subgraphs rainbow

arxiv.org · 150 words · saved by 1 readers

N/A

Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph $K_n$ has a rainbow Hamiltonian path. Although this conjecture turned out to be false, it was widely believed that such a colouring always contains a rainbow cycle of length almost $n$. In this paper, improving on several earlier results, we confirm this by proving that every properly edge-coloured $K_n$ has a rainbow cycle of length $

Explore this link on the map →

saved by

related reading