Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs
From MaRDI portal
Publication:5001845
DOI10.1137/20M1332992zbMath1468.05067arXiv2004.08637OpenAlexW3182189681MaRDI QIDQ5001845
Publication date: 23 July 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.08637
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- The longest path in a random graph
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
- Random perturbation of sparse graphs
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
- Rainbow matchings and Hamilton cycles in random graphs
- Rainbow Hamilton cycles in random graphs and hypergraphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
- Adding random edges to dense graphs
- How many random edges make a dense graph hamiltonian?
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- Powers of Hamiltonian cycles in randomly augmented graphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Tilings in Randomly Perturbed Dense Graphs
- Long paths and Hamiltonicity in random graphs
- Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
- Rainbow hamilton cycles in random graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs
