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 Lovász Local Lemma and Its Applications to some Combinatorial Arrays
✍ Scribed by D. Deng; D. R. Stinson; R. WEI
- Book ID
- 111579080
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 146 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0925-1022
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
An Extension of the Lovász Local Lemma,
✍
Srinivasan, Aravind
📂
Article
📅
2006
🏛
Society for Industrial and Applied Mathematics
🌐
English
⚖ 291 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
The Repulsive Lattice Gas, the Independe
✍
Alexander D. Scott; Alan D. Sokal
📂
Article
📅
2005
🏛
Springer
🌐
English
⚖ 784 KB
An extension of Stein-Lovász theorem and
✍
Guang-Siang Lee
📂
Article
📅
2011
🏛
Springer US
🌐
English
⚖ 530 KB