The Bounded-VC chromatic thresholds of graphs

Jinze Hu, Qinghai Liu, Liping Zhang +1

For a graph $H$, the chromatic threshold ${\delta }_{\chi }(H)$ is the infimum of $c>0$ such that the chromatic number of every $n$-vertex $H$-free graph with minimum degree at least $cn$ is bou…