Erdős Problem #737
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
For a graph needing ℵ₁ colours, can one find a SINGLE edge lying on a cycle of EVERY sufficiently large length? Erdős #737 asks for the same edge to work across all large cycle lengths. The answer is PROVED by Thomassen, not merely a statement about existence of some cycle at each length.
A small example
In the complete graph K₄, every edge lies in a triangle and a 4-cycle, and no cycle longer than four exists. This example illustrates an edge shared across lengths but cannot establish anything about ℵ₁-chromatic graphs.
What is known
Erdős–Hajnal–Shelah [EHS74] proved that every ℵ₁-chromatic graph contains cycles of all sufficiently large lengths. Thomassen [Th83] established the stronger fixed-edge statement. The quantifier orders differ: ∃e ∀large ℓ versus ∀large ℓ ∃some cycle whose edge can depend on ℓ. The current catalogue credits the former result to Thomassen. Exact primary 1983 proof pages not replayed.
GCL's current state
The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.
Critical source-scope distinction: Thomassen ℵ1-chromatic fixed SAME edge across every large cycle length, not weaker existence of cycles.
What remains
Inspect Thomassen's exact 1983 source theorem and its graph/cardinality hypotheses, and ensure the claimed edge is independent of cycle length. Reproduce one finite graph fixture and integrate theorem provenance in the critical review.
Sources and claim boundaries
Maintained #737; GCL source return. No new mathematical theorem proof is claimed.
Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2008 — 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.