A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω1. Issue 1 (19th January 2015)

• Record Type: Journal Article
• Authors: King, Andrew D.; Reed, Bruce A.
• Is Part Of: Journal of graph theory. Volume 81:Issue 1(2016)
• Page Start: 30
• Page End: 34
• Publication Date: 2015-01-19
• Subjects: chromatic number -- clique number -- graph coloring -- maximum degree -- Reed's Conjecture; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.21858
• Languages: English
• ISSNs: 0364-9024

Abstract

Abstract: In 1998 the second author proved that there is an ε > 0 such that every graph satisfies χ ≤ ⌈ ( 1 − ε ) ( Δ + 1 ) + ε ω ⌉ . The first author recently proved that any graph satisfying ω > 2 3 ( Δ + 1 ) contains a stable set intersecting every maximum clique. In this note, we exploit the latter result to give a much shorter, simpler proof of the former. Working from first principles, we omit only some five pages of proofs of known intermediate results (which appear in an extended version of this paper), and the proofs of Hall's Theorem, Brooks' Theorem, the Lovász Local Lemma, and Talagrand's Inequality.