Albertson's Conjecture for Chromatic Numbers at Most 29

Sen Cao, Sanjit Singh Mehat

Albertson's conjecture asserts that every finite simple graph $G$ with $\chi (G)\ge r$ satisfies $\mathrm{cr}(G)\ge \mathrm{cr}(K_r)$. Building on Cranston's verification…