Form equivalence class Howard-Rubin Number: 14
Statement: Let \(H\) be a hypergraph whose edges contain at mostthree vertices. If every finite subhypergraph of \(H\) is 2-colorable then\(H\) is 2-colorable. Cowen [1990] and Note 117.
Howard-Rubin number: 14 BG
Citations (articles):
Connections (notes):
References (books):
Back