Form equivalence class Howard-Rubin Number: 1
Statement:
Every graph has a chromatic number.
Howard-Rubin number: 1 AW
Citations (articles):
Komj'ath/Galvin [1991]
Graph colorings and the axiom of choice
Connections (notes):
Note [118]
Definitions from Galvin/Komj\'ath [1991]
for forms [1 AT] through [1 AW].
References (books):
Back