Erdős Problem #753
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: graph theory, chromatic number.
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.
The question in plain language
Let χ_L(G) denote the list-chromatic number: the smallest t such that EVERY assignment of a t-element palette at each vertex permits a proper colour selection. Erdős, Rubin and Taylor asked whether a fixed c>0 ensures χ_L(G)+χ_L(complement G)>n^(1/2+c) for EVERY n-vertex graph. The answer is DISPROVED by Alon (1992), which constructs a graph for each n with χ_L(G)+χ_L(G^c)=O(sqrt(n log n)). The reported LEAN status is external, not a GCL kernel replay.
A small example
For the complete graph K_n, χ_L(K_n)=n while χ_L(the empty n-vertex graph)=1: the sum is n+1. This example SATISFIES a super-square-root bound, so it cannot disprove the conjecture. Alon's counterexamples must balance the two list-colouring difficulties instead. For n=2, K2 has χ_L=2 and its complement 1, sum 3.
What is known
Unlike ordinary chromatic number, χ_L quantifies over all lists of t colours, not a single shared palette, and χ_L(G)≥χ(G). Alon's uniform construction with both G and complement having sum at most C sqrt(n log n) is asymptotically smaller than n^(1/2+c) for ANY fixed c>0, since sqrt(log n)=o(n^c). Thus a single family for arbitrarily large n refutes the universal claim. Original Alon [Al92] full proof uninspected. Maintained site labels DISPROVED (LEAN), but neither a protected #753.lean in the GCL-pinned provider nor independently replayed Lean proof was established in this audit.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: alon list chromatic sum disproved; external lean not gcl admitted. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Source-lock Alon 1992 theorem with exact constants and list-colouring definition, then show analytically C sqrt(n log n)<n^(1/2+c) for large n. Build tiny K2 and complement list-choosability fixtures. Distinguish ordinary chromatic Nordhaus–Gaddum inequalities from the list version.
Sources and claim boundaries
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2024 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.