← All problems

El-Zahar–Erdős conjecture

This entry tracks El-Zahar–Erdős conjecture.

It gives a strong negative answer that persists far beyond triangle-free graphs.

Latest development

For every g≥4, the construction has girth at least g and fails the conjectured pair of disjoint anticomplete high-chromatic induced subgraphs.

Editorial caveat

The counterexample claim is unrefereed and lacks independent assessment.

References

Source: arXiv

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.