Form equivalence class Howard-Rubin Number: 14
Statement: (\(n\in \omega\), \(n\ge 3\)) \(P_{n}\): Forevery graph \(G\) if every finite subgraph of \(G\) is \(n\)-colorablethen \(G\) is \(n\)-colorable. L\"auchli [1971] and Note 117.
Howard-Rubin number: 14 G(n)
Citations (articles):
Connections (notes):
References (books):
Back