Form equivalence class Howard-Rubin Number: 1
Statement:
For all cardinal numbers \(\kappa_1\) and \(\kappa_2\), if a graph is both \(\kappa_1\) and \(\kappa_2\) colorable then it is also\(\kappa\) colorable for some \(\kappa\) such that \(\kappa\le^*\kappa_1\) and \(\kappa\le^*\kappa_2\). (\(\le^*\) is the surjective cardinal ordering).
Howard-Rubin number: 1 AT
Citations (articles):
Komj'ath/Galvin [1991]
Graph colorings and the axiom of choice
Connections (notes):
References (books):
Back