The Lovász Local Lemma yields sufficient conditions for a hypergraph to be 2-colorable, that is, to have a coloring of the points blue or red such that no edge is monochromatic. The method yields a general theorem, which shows for example, if H is a hypergraph in which each edge contains at least 9
✦ LIBER ✦
The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma
✍ Scribed by Alexander D. Scott; Alan D. Sokal
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 784 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Coloring and the Lovász Local Lemma
✍
Xing Chen; Zhihua Du; Jixiang Meng
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 304 KB
Hypergraph colouring and the Lovász Loca
✍
Colin McDiarmid
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 263 KB
The Lov~sz Local Lemma yields sufficient conditions for a hypergraph to be 2-colourable, that is, to have a colouring of the points blue or red so that no edge is monochromatic. The method yields a general theorem, which shows for example that, if H is a hypergraph in which each edge contains at lea
Coloring nonuniform hypergraphs: A new a
✍
Artur Czumaj; Christian Scheideler
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 202 KB
👁 1 views
Lattice gas generalization of the hard h
✍
R. J. Baxter; George E. Andrews
📂
Article
📅
1986
🏛
Springer
🌐
English
⚖ 895 KB
Lattice gas models in contact with stoch
✍
Gregory Eyink; Joel L. Lebowitz; Herbert Spohn
📂
Article
📅
1991
🏛
Springer
🌐
English
⚖ 540 KB