Stop the war!
Остановите войну!
for scientists:
default search action
"Every 8-uniform 8-regular hypergraph is 2-colorable."
Noga Alon, Z. Bregman (1988)
- Noga Alon, Z. Bregman:
Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs Comb. 4(1): 303-306 (1988)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.