Does every graph needing k colours contain k pairwise vertex-disjoint connected subgraphs mutually joined by edges? One conjecture that would explain ALL of colouring.
The Problems
Not schoolwork — the questions that resisted Erdős, Hilbert, and everyone since. The club keeps three shelves: what is still open, what AI recently settled, and what took humanity centuries.
Tagged graph-minors — 1 entry. Clear