Noga Alon, Z. Bregman. Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs and Combinatorics, 4(1):303-306, 1988. [doi]
@article{AlonB88,
title = {Every 8-uniform 8-regular hypergraph is 2-colorable},
author = {Noga Alon and Z. Bregman},
year = {1988},
doi = {10.1007/BF01864169},
url = {http://dx.doi.org/10.1007/BF01864169},
researchr = {https://researchr.org/publication/AlonB88},
cites = {0},
citedby = {0},
journal = {Graphs and Combinatorics},
volume = {4},
number = {1},
pages = {303-306},
}