Towards the Albertson conjecture (Q976729)

Summary: Albertson conjectured that if a graph \(G\) has chromatic number \(r\), then the crossing number of \(G\) is at least as large as the crossing number of \(K_r\), the complete graph on \(r\) vertices. \textit{M.O. Albertson}, \textit{D.W. Cranston}, and \textit{J. Fox} [``Crossings, colorings, and cliques'', Electron. J. Comb. 16, No.\,1, Research Paper R45 (2009; Zbl 1182.05035)] verified the conjecture for \(r \geqslant 12\). In this paper we prove it for \(r\leqslant 16\).