The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565)

In the paper it is proved that Erdös-Lovász s-splitting conjecture from 1968 is true for quasi-line graphs and graphs with independence number 2. Let \(\chi (G)\) be chromatic number and \(\omega (G)\) clique number of graph \(G\). A graph \(G\) is \((s,t)\)-splittable if \(V(G)\) can be partitioned into two sets S and T such that \(\chi (G[S])\geq s\) and \(\chi (G[T])\geq t\). Graph \(G\) is s-splittable if it is \((s, \chi (G)-s+1)\)-splittable. Erdös and Lovász conjectured that for every integer \(s \geq 2\) every graph with \(\chi (G)> max\{\omega (G) , s\}\) is s-splittable. A quasi-line graph is a graph in which the neighborhood of any vertex can be covered by two cliques. In the paper it is proved that quasi-line graph with \(\chi (G)> max\{\omega (G) , s\}\) is \(s\)-splittable.