Year: 2026
Type: preprint
Abstract: El-Zahar and Erdős asked whether every graph of bounded clique number and sufficiently large chromatic number contains two vertex-disjoint induced subgraphs, each of large chromatic number, with no edge between them. We give a negative answer even for triangle-free graphs. For every integer $g \ge 4$, we show by a probabilistic argument that there exist graphs of girth at least $g$ and arbitrarily large chromatic number in which any two vertex-disjoint induced subgraphs that each require at least seven colors are joined by an edge.
Source: arXiv (Cornell University)
Authors: Liu, Chenghua, Meng, Boning
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236653505
