Coloring and the Lovász local lemma

DOI10.1016/j.aml.2009.02.008zbMath1213.05186OpenAlexW2089137727WikidataQ124807375 ScholiaQ124807375MaRDI QIDQ847296

Xing Chen, Zhihua Du, Ji Xiang Meng

Publication date: 12 February 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.02.008

zbMATH Keywords

Lovász local lemma\(t\)-coloringlopsidependency graph

Mathematics Subject Classification ID

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

Related Items (3)

Polychromatic colorings of hypergraphs with high balance ⋮ Polychromatic colorings and cover decompositions of hypergraphs ⋮ 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs

Cites Work

• Lopsided Lovász Local lemma and Latin transversals
• Hypergraph colouring and the Lovász local lemma
• 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
• Unnamed Item
• Unnamed Item

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