Skip to content

Erdős Problem #760

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

Suppose graph G has ordinary chromatic number χ(G)=m. Erdős and Gimbel ask if G must contain a (not necessarily induced) subgraph H whose cochromatic number satisfies ζ(H)≥c m/log m for an absolute c>0 and sufficiently large m. This is PROVED by Alon, Krivelevich and Sudakov [AKS97], improving Erdős–Gimbel's earlier bound c√(m/log m). The qualifier 'subgraph' is essential.

A small example

The complete graph K3 has χ=3 but ζ(K3)=1, because its entire vertex set forms a clique class. By DELETE ONE EDGE, obtain the three-vertex path P3 as an ordinary subgraph, which has ζ(P3)=2. Thus passing to a noninduced subgraph can increase cochromatic number; one cannot simply take H=G and assert the theorem.

What is known

Alon–Krivelevich–Sudakov [AKS97] proved the lower order m/log m for the maximal ζ of a subgraph of any χ=m graph. The maintained source calls this best possible up to constants, citing complete-graph cases. ζ(G)≤χ(G) always, since a proper independent-set coloring is a cochromatic coloring, but this upper alone does not yield the lower for a specific G. The source labels PROVED (LEAN) in a 2026 page, whereas the frozen source packet says unformalized and the admitted FC-GDM-85F86371 provider has no #760 theorem. An external Lean report must be separately traced, not assumed accepted.

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: aks97 proved subgraph cochromatic lower; non induced subgraph required; external lean not gcl replayed. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Review AKS97 original theorem and proof, with subgraph vs induced terminology, and verify ζ(K3)=1, ζ(P3)=2. Trace any 2026 external Lean status to exact proof hash and #print axioms before claiming GCL formal certification.

Sources and claim boundaries

Maintained #760; 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: #2031 — 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