Structure in sparse $k$-critical graphs

Ron Gould, Victor Larsen, Luke Postle

Recently, Kostochka and Yancey proved that a conjecture of Ore is asymptotically true by showing that every $k$-critical graph satisfies $|E(G)|\geq\left\lceil\left(\frac{k}{2}-\fr…