On the Erdös-Lovász Tihany Conjecture for Claw-Free Graphs

Maria Chudnovsky, Alexandra Fradkin, Matthieu Plumettaz

In 1968, Erdös and Lovász conjectured that for every graph $G$ and all integers $s,t\ge 2$ such that $s+t-1=\chi (G)>\omega (G)$, there exists a partition $(S,T)$ of the vertex set of $G$…