Rainbow hamilton cycles in random graphs
From MaRDI portal
Publication:5415595
DOI10.1002/rsa.20475zbMath1290.05097arXiv1101.0182OpenAlexW1980608991WikidataQ57401422 ScholiaQ57401422MaRDI QIDQ5415595
Publication date: 13 May 2014
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.0182
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (15)
Colorful Hamilton Cycles in Random Graphs ⋮ Packing Directed Hamilton Cycles Online ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ On rainbow Hamilton cycles in random hypergraphs ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) ⋮ The threshold for the full perfect matching color profile in a random coloring of random graphs ⋮ Power of \(k\) choices and rainbow spanning trees in random graphs ⋮ Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs ⋮ Rainbow matchings and Hamilton cycles in random graphs ⋮ Universality of random graphs and rainbow embedding ⋮ Rainbow Arborescence in Random Digraphs ⋮ Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs ⋮ Pattern Colored Hamilton Cycles in Random Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Loose Hamilton cycles in random uniform hypergraphs
- Loose Hamilton cycles in random 3-uniform hypergraphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Multicoloured Hamilton cycles
- Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
- Rainbow Hamilton cycles in random regular graphs
- Factors in random graphs
- An algorithm for finding hamilton cycles in random directed graphs
- General percolation and random graphs
- Almost all regular graphs are hamiltonian
- Multicolored trees in random graphs
- General first-passage percolation
This page was built for publication: Rainbow hamilton cycles in random graphs