Coloring of graphs without long odd holes (2504.01808v1)

Abstract: A {\em hole} is an induced cycle of length at least 4, a $k$-hole is a hole of length $k$, and an {\em odd hole} is a hole of odd length. Let $\ell\ge 2$ be an integer. Let ${\cal A}{\ell}$ be the family of graphs of girth at least $2\ell$ and having no odd holes of length at least $2\ell+3$, let ${\cal B}{\ell}$ be the triangle-free graphs which have no 5-holes and no odd holes of length at least $2\ell+3$, and let ${\cal G}{\ell}$ be the family of graphs of girth $2\ell+1$ and have no odd hole of length at least $2\ell+5$. Chudnovsky {\em et al.} \cite{CSS2016} proved that every graph in ${\cal A}{2}$ is 58000-colorable, and every graph in ${\cal B}{\ell}$ is $(\ell+1)4^{\ell-1}$-colorable. Lan and liu \cite{LL2023} showed that for $\ell\geq3$, every graph in ${\cal G}{\ell}$ is 4-colorable. It is not known whether there exists a small constant $c$ such that graphs of ${\cal G}2$ are $c$-colorable. In this paper, we show that every graph in ${\cal G}_2$ is 1456-colorable, and every graph in ${\cal A}{3}$ is 4-colorable. We also show that every 7-hole free graph in ${\cal B}_{\ell}$ is $(12\ell+8)$-colorable.