Revisiting a theorem by Folkman on graph colouring

Marthe Bonamy, Pierre Charbit, Oscar Defrain +5

We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of any graph is at most $2$ plus the maximum over all subgraphs of the difference…