Revisiting a theorem by Folkman on graph colouring
Combinatorics
2020-03-24 v2
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 plus the maximum over all subgraphs of the difference between half the number of vertices and the independence number.
Cite
@article{arxiv.1907.11429,
title = {Revisiting a theorem by Folkman on graph colouring},
author = {Marthe Bonamy and Pierre Charbit and Oscar Defrain and Gwenaël Joret and Aurélie Lagoutte and Vincent Limouzy and Lucas Pastor and Jean-Sébastien Sereni},
journal= {arXiv preprint arXiv:1907.11429},
year = {2020}
}
Comments
v2: revised following referees' comments