As is well known, Lovász Local Lemma implies that every d-uniform d-regular hypergraph is 2-colorable, provided d ≥ 9. We present a different proof of a slightly stronger result; every d-uniform d-regular hypergraph is 2-colorable, provided d ≥ 8.
|Original language||English (US)|
|Number of pages||4|
|Journal||Graphs and Combinatorics|
|State||Published - Dec 1 1988|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics