Title:
Two graph classes with bounded chromatic number
Two graph classes with bounded chromatic number
Author(s)
Schroeder, Joshua
Advisor(s)
Yu, Xingxing
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
A class of graphs is said to be $\chi$-bounded with binding function $f$ if for every such graph $G$, it satisfies $\chi(G) \leq f(\omega(G)$, and polynomially $\chi$-bounded if $f$ is a polynomial. It was conjectured that chair-free graphs are perfectly divisible, and hence admit a quadratic $\chi$-binding function. In addition to confirming that chair-free graphs admit a quadratic $\chi$-binding function, we will extend the result by demonstrating that $t$-broom free graphs are polynomially $\chi$-bounded for any $t$ with binding function $f(\omega) = O(\omega^{t+1})$. A class of graphs is said to satisfy the Vizing bound if it admits the $\chi$-binding function $f(\omega) = \omega + 1$. It was conjectured that (fork, $K_3$)-free graphs would be 3-colorable, where fork is the graph obtained from $K_{1, 4}$ by subdividing two edges. This would also imply that (paw, fork)-free graphs satisfy the Vizing bound. We will prove this conjecture through a series of lemmas that constrain the structure of any minimal counterexample.
Sponsor
Date Issued
2023-07-17
Extent
Resource Type
Text
Resource Subtype
Dissertation