Form equivalence class Howard-Rubin Number: 88
Statement:
\(G_{2}\): A graph is 2-colorable if every finite subgraph is 2-colorable. note 117.
Howard-Rubin number: 88 B
Citations (articles):
Mycielski [1961]
Some remarks and problems on the coloring of infinite graphs and the theorem of Kuratowski
Connections (notes): Note [117]
Definitions from Cowen [1990] for forms [14 BD] through [14 BG].
References (books):
Back