Back to search
University of Waterloo
On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree
Abstract
dc:description.abstractWe prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of size ∆(G) − 17. Our proof closely parallels a proof from Cranston and Rabern, who showed that graphs with χ = ∆ and ∆ ≥ 13 contain a clique of size ∆ − 3. Their result is the best currently known for general ∆ towards the Borodin-Kostochka conjecture, which posits that graphs with χ = ∆ and ∆ ≥ 9 contain a clique of size ∆. We also outline some related progress which has been made towards the conjecture.
Degree
thesis:*- Grantor dc:publisher
- University of Waterloo
- Year dc:date.issued
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- MacDonald, Colter
- Advisor dc:contributor.advisor
-
- Haxell, Penelope
Subjects
dc:subject × 3Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10012/17820