English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $s\ge2$ and $t\ge2$ 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])\geq s$ and $\chi(G[T])\geq t$. The well-known Erd\H{o}s-Lov\'aszTihany 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 theErd\H{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 bestpossible.

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