# Induced subgraphs of graphs with large chromatic number. VII. Gy\'arf\'as' complementation conjecture

## TL;DR

This paper proves Gyárfás' complementation conjecture, establishing that classes of graphs with bounded difference between chromatic and clique numbers have complements that are χ-bounded, using properties of odd holes and dominating sets.

## Contribution

It confirms Gyárfás' conjecture and generalizes χ-boundedness to classes avoiding multiple disjoint odd holes with no interconnecting edges.

## Key findings

- Proves Gyárfás' complementation conjecture.
- Shows classes with no c+1 disjoint odd holes are χ-bounded.
- Introduces a lemma on dominating sets in graphs with shortest odd holes.

## Abstract

A class of graphs is $\chi$-bounded if there is a function $f$ such that $\chi(G)\le f(\omega(G))$ for every induced subgraph $G$ of every graph in the class, where $\chi,\omega$ denote the chromatic number and clique number of $G$ respectively. In 1987, Gy\'arf\'as conjectured that for every $c$, if $\mathcal{C}$ is a class of graphs such that $\chi(G)\le \omega(G)+c$ for every induced subgraph $G$ of every graph in the class, then the class of complements of members of $\mathcal{C}$ is $\chi$-bounded. We prove this conjecture. Indeed, more generally, a class of graphs is $\chi$-bounded if it has the property that no graph in the class has $c+1$ odd holes, pairwise disjoint and with no edges between them. The main tool is a lemma that if $C$ is a shortest odd hole in a graph, and $X$ is the set of vertices with at least five neighbours in $V(C)$, then there is a three-vertex set that dominates $X$.