<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T13:35:23Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/17820" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/17820</identifier><datestamp>2025-03-26T23:33:05Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Haxell, Penelope</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="45ceeabb-2328-4bf2-aabb-ae1339523269" confidence="600">MacDonald, Colter</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-12-23T22:30:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-12-23T22:30:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-12-23</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2020-12-14</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/17820</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">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.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph colouring</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">combinatorics</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Haxell, Penelope</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>