Coloring and the Lovász local lemma

DOI10.1016/J.AML.2009.02.008zbMATH Open1213.05186OpenAlexW2089137727WikidataQ124807375 ScholiaQ124807375MaRDI QIDQ847296FDOQ847296

Authors: Xing Chen, Zhihua Du, Jixiang 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

Recommendations

• Hypergraph colouring and the Lovász local lemma
• Improved bounds and algorithms for hypergraph 2-coloring
• An algorithmic approach to the Lovász local lemma. I
• Publication:4952595
• Every 8-uniform 8-regular hypergraph is 2-colorable

zbMATH Keywords

\(t\)-coloringlopsidependency graphLovász local lemma

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Hypergraph colouring and the Lovász local lemma
• An algorithmic approach to the Lovász local lemma. I
• Title not available (Why is that?)
• Lopsided Lovász Local lemma and Latin transversals
• The Even Cycle Problem for Directed Graphs
• A parallel algorithmic version of the local lemma
• Every 8-uniform 8-regular hypergraph is 2-colorable

Cited In (8)

• Polychromatic colorings and cover decompositions of hypergraphs
• Measurable versions of the Lovász local lemma and measurable graph colorings
• Acyclic edge coloring through the Lovász local lemma
• A note on near-optimal coloring of shift hypergraphs
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• A general framework for hypergraph coloring
• Polychromatic colorings of hypergraphs with high balance
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847296)