Revisiting a Theorem by Folkman on Graph Colouring

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Electronic journal of combinatorics 2020-03, Vol.27 (1)
Hauptverfasser: Bonamy, Marthe, Charbit, Pierre, Defrain, Oscar, Joret, Gwenaël, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas, Sereni, Jean-Sébastien
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Mathematics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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