The reviewed record of science sign in
Pith

arxiv: 1907.11429 · v2 · pith:RA52SFH5 · submitted 2019-07-26 · math.CO

Revisiting a theorem by Folkman on graph colouring

Marthe Bonamy , Pierre Charbit , Oscar Defrain , Gwena\"el Joret , Aur\'elie Lagoutte , Vincent Limouzy , Lucas Pastor , Jean-S\'ebastien Sereni This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RA52SFH5record.jsonopen to challenge →

classification math.CO
keywords numberfolkmangraphtheoremchromaticcolouringdifferencefollowing
0
0 comments X
read the original 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 half the number of vertices and the independence number.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.