Skip to content

Erdős Problem #758

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (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

The cochromatic number ζ(G) is the minimum number of parts partitioning V(G) such that each part induces EITHER a clique OR an independent set. Let z(n) be the maximum ζ(G) among all n-vertex graphs. Erdős–Gimbel asked for small exact values, especially whether z(12)=4. The maintained source says SOLVED at n=12, but the exact next unknown z(20) is either 6 or 7.

A small example

For the three-vertex path P3 (two incident edges), ζ(P3)=2: the two endpoints form an independent colour class and the middle vertex a singleton; ζ≠1 since P3 itself is neither a clique nor independent. For K3, ζ(K3)=1 as the whole graph is a clique. Thus z(3)=2. These tiny examples cannot verify z(12) classification.

What is known

Erdős–Gimbel had 4≤z(12)≤5. Bhavik Mehta's reported computational classification found, up to complement, a unique 12-vertex graph with both graph and complement K4-free and both chromatic numbers at least 5; direct cochromatic testing gives ζ=4, completing z(12)=4. The maintained page lists z(n) for 1≤n≤19: 1,1,2,2,3,3,3,3,4,4,4,4,5,5,5,6,6,6,6. Gimbel [Gi86] had already shown z(n)≈n/log n asymptotically. The exceptional 12-vertex computational certificate was not independently reproduced or archived as a GCL accepted proof.

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: bhavik mehta z12 equals four computational classification; z20 six vs seven unknown; computational certificate not gcl replayed. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Inspect Mehta's graph source and independent computational certificate for the unique 12-vertex case; reproduce exhaustive ζ(P3)=2, z(3)=2 and bound constructions for n≤8. Distinguish a particular graph's χ and χ(complement) from its ζ, and keep z(20) unresolved.

Sources and claim boundaries

Maintained #758; authenticated source report. Full original theorem proof/source pages pending. no new independent primary theorem certification, public-browser mathematical rendering or V2 admission.

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: #2029 — 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