UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree

Thumbnail Image

Files

MacDonald_Colter.pdf (353 KB)

Date

2021-12-23

Authors

MacDonald, Colter

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

We 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.

Description

Keywords

graph theory, graph colouring, combinatorics

LC Keywords

Citation

URI

http://hdl.handle.net/10012/17820

Collections

Theses
Combinatorics and Optimization