Revisiting a theorem by Folkman on graph colouring
Abstract
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 between the number of vertices and twice the independence number.
Origin : Files produced by the author(s)
Loading...