Hypergraph colouring and the Lovász local lemma

DOI10.1016/S0012-365X(96)00249-XzbMath0873.05067WikidataQ124913579 ScholiaQ124913579MaRDI QIDQ1356486

Colin J. H. McDiarmid

Publication date: 17 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Lovász local lemmahypergraph coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

On \(r\)-dynamic coloring of graphs ⋮ Coloring and the Lovász local lemma ⋮ Graph \(r\)-hued colorings -- a survey ⋮ On the dynamic coloring of graphs ⋮ On \(r\)-dynamic chromatic number of graphs ⋮ A Kolmogorov complexity proof of the Lovász local lemma for satisfiability ⋮ Dynamic chromatic number of regular graphs ⋮ Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lopsided Lovász Local lemma and Latin transversals
• Every 8-uniform 8-regular hypergraph is 2-colorable
• An algorithmic approach to the Lovász local lemma. I
• A parallel algorithmic version of the local lemma
• The Even Cycle Problem for Directed Graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS

This page was built for publication: Hypergraph colouring and the Lovász local lemma