Every 8-uniform 8-regular hypergraph is 2-colorable |
| |
| Authors: | N Alon Z Bregman |
| |
| Institution: | (1) School of Mathematical Sciences, Sackler Faculty of Exact Sciences Tel Aviv University, Ramat Aviv, Tel Aviv, Israel |
| |
| Abstract: | As is well known, Lovász Local Lemma implies that everyd-uniformd-regular hypergraph is 2-colorable, providedd  9. We present a different proof of a slightly stronger result; everyd-uniformd-regular hypergraph is 2-colorable, providedd 8.Research supported in part by Allon Fellowship and by a grant from the United States Israel Binational Science Foundation. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
