Revisiting a Theorem by Folkman on Graph Colouring

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.

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 27; no. 1
Main Authors Bonamy, Marthe, Charbit, Pierre, Defrain, Oscar, Joret, Gwenaël, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas, Sereni, Jean-Sébastien
Format Journal Article
LanguageEnglish
Published Open Journal Systems 20.03.2020
Subjects
Combinatorics
Mathematics
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1077-8926
1077-8926
DOI:10.37236/8899