Skip to content

Erdős Problem #762

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

For a graph G with no K5 and cochromatic number ζ(G)≥4, Erdős, Gimbel and Straight conjectured χ(G)≤ζ(G)+2, where ζ is the minimum partition into induced cliques or independent sets. The conjecture is DISPROVED by Raphael Steiner [St24b], with a graph having clique number ω=4, ζ=4 and χ=7. The threshold is violated as 7>4+2=6.

A small example

The four-vertex complete graph K4 has ω(K4)=4 and χ(K4)=4, but ζ(K4)=1 because its entire vertex set induces one clique. It does NOT satisfy the conjecture's ζ≥4 hypothesis; thus K4 is not a counterexample. The Steiner graph with ω=4, ζ=4 and χ=7 supplies the actual counterexample, but its large graph and parameter certificates are externally attributed rather than independently checked here.

What is known

The maintained page credits Erdős–Gimbel–Straight with χ(G)≤ζ(G)+f(t) for K_t-free graphs, with f(t) dependent on t, not necessarily f(5)=2. Steiner [St24b] refutes this sharper f(5)=2. A February 2026 forum reports a formalized counterexample aided by Aristotle and ChatGPT, involving a finite base check of an 11-vertex graph. Follow-up comments in June 2026 discuss replacing native_decide with decide and a large explicit counterexample (1177 vertices, 5400 edges). GCL's pinned formal statement exists but its exact axiom closure and compilation were not replayed; do not certify merely from externally reported Lean.

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: steiner disproved chi le zeta plus 2; large graph and external lean not gcl replayed. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Source-lock Steiner's graph construction and verify ω=4, ζ=4, χ=7 by independent certificates, recording any use of native_decide, decide, and universe assumptions in external Lean. A tiny K4 example only tests terminology, not the disproof.

Sources and claim boundaries

Maintained #762; authenticated source return. Historic primary proofs, external Lean and deployed browser MathJax not fully audited. source-qualified editorial review recorded.

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: #2033 — 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.

Back to catalogue · Compendium introduction