Erdős Problem #1111
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: graph theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Two disjoint groups of vertices \(A\) and \(B\) are called anticomplete when no edge of a graph runs from one group to the other.
Erdős Problem #1111 asks whether graphs that need very many vertex colours, but do not contain large complete subgraphs, must contain two anticomplete subsets that each need many colours themselves.
More precisely, given \(t,c\ge1\), is there a threshold \(d(t,c)\) such that every finite graph \(G\) with
has disjoint anticomplete \(A,B\) with \(\chi(G[A]),\chi(G[B])\ge c\)?
A small example
The five-cycle \(C_5\) has chromatic number three and clique number two. It contains five pairs of disjoint edges, but none of those pairs is anticomplete: in every case another cycle edge connects an endpoint of one to an endpoint of the other.
Thus \(C_5\) has no anticomplete pair \(A,B\) for which both induced graphs need at least two colours. The exact five-edge enumeration illustrates why the threshold for \((t,c)=(3,2)\) cannot be three. The maintained source reports \(d(3,2)=4\).
What is known
El Zahar and Erdős (1985) studied the question and established several bounded-chromatic cases. The maintained catalogue reports results for \(c=2\) and a bound \(d(3,3)\le8\).
A later theorem of Nguyen, Scott and Seymour (2024) produces anticomplete \(A,B\) with \(\chi(G[B])\ge c\) while the graph induced on \(A\) has minimum degree at least \(c\).
That distinction matters. Minimum degree at least \(c\) does not imply chromatic number at least \(c\): a complete bipartite graph \(K_{c,c}\) has minimum degree \(c\) but requires only two colours. The newer result therefore cannot be substituted for the two-chromatic-subset assertion without a further argument.
The broad two-subset chromatic question remains listed as open.
GCL's current state
Authenticated source audit #2382 checks the exact \(C_5\) obstruction and separates the minimum-degree variant from the original chromatic conclusion.
The original 1985 and 2024 proofs are not yet independently source-reviewed. The maintained catalogue does not list a formalized version of the original problem.
What remains
Check both original theorems and determine whether there are additional hypotheses that could bridge minimum degree to chromatic complexity in the anticomplete setting. Independently review the small values of \(d(t,c)\) and their proof methods.
Sources and claim boundaries
Erdős Problem #1111; El Zahar–Erdős (1985); Wagon (1980); Nguyen–Scott–Seymour (2024); authenticated GCL return #2382. The small five-cycle calculation is independently exact. The general problem remains open and this draft is unaccepted.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2382 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.