Rainbow Hamilton cycles and lopsidependency
From MaRDI portal
Publication:2400558
DOI10.1016/j.disc.2017.01.026zbMath1369.05129OpenAlexW2603167390MaRDI QIDQ2400558
Christopher Liaw, Nicholas J. A. Harvey
Publication date: 29 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.026
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow Hamilton cycles in uniform hypergraphs
- Polychromatic Hamilton cycles
- Lopsided Lovász Local lemma and Latin transversals
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Asymptotic lower bounds for Ramsey functions
- Multicoloured Hamilton cycles
- Quest for Negative Dependency Graphs
- Rainbow Hamilton cycles in random graphs and hypergraphs
- An Improvement of the Lovász Local Lemma via Cluster Expansion
- Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
- An Extension of the Moser--Tardos Algorithmic Local Lemma
- Rainbow Hamilton cycles in random regular graphs
- A constructive proof of the general lovász local lemma
- An algorithmic approach to the Lovász local lemma. I
- Focused Stochastic Local Search and the Lovász Local Lemma
- Lopsidependency in the Moser-Tardos Framework
- A constructive proof of the Lovász local lemma
- A constructive algorithm for the Lovász Local Lemma on permutations
- Rainbow hamilton cycles in random graphs
- Moser and tardos meet Lovász
This page was built for publication: Rainbow Hamilton cycles and lopsidependency
