A disproof of the El-Zahar--Erdős conjecture
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.
Authors
- Boning Meng
- Chenghua Liu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24735
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint