Enhancing the Erd\H{o}s-Lov\'asz Tihany Conjecture for graphs with independence number two

MaRDI QIDQ6347313zbMATH OpenFDO

Authors Gexin Yu

Publication date 18 August 2020

Abstract: Let $sge2$ and $tge2$ be integers. A graph $G$ is $(s,t)$-emph{splittable} if $V(G)$ can be partitioned into two sets $S$ and $T$ such that $chi(G[S])geqs$ and $chi(G[T])geqt$. The well-known ErdH{o}s-Lov'asz Tihany Conjecture from 1968 states that every graph $G$ whose chromatic number $chi(G)=s+t-1$ is more than its clique number $omega(G)$ is $(s,t)$-splittable. In this paper, we prove an enhanced version of the ErdH{o}s-Lov'asz Tihany Conjecture for graphs with independence number two. That is, for every graph $G$ with $chi(G)=s+t-1>omega(G)+1$ is $(s,t+1)$-splittable. There are examples showing that this result is best possible.

This page was built for publication: Enhancing the Erd\H{o}s-Lov\'asz Tihany Conjecture for graphs with independence number two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347313)