On the maximum number of edges in k-critical graphs

Cong Luo, Jie Ma, Tianchi Yang

A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to deter…