Skip to content

Erdős Problem #740

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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 an infinite cardinal m and graph G with chromatic number exactly m, and integer r≥1, can one remove edges or pass to a subgraph H without reducing the chromatic cardinal while eliminating EVERY odd cycle of length at most r? Erdős–Hajnal #740 remains OPEN in the maintained source. The form asking for arbitrary finite GIRTH, rather than just absence of short odd cycles, is a stronger, separate question. The source reports a positive case for m=aleph_0 and r=3 by Rödl, but not an all-cardinals theorem.

A small example

For r=3, 'no odd cycle of length at most three' says exactly triangle-free, because simple graphs have no odd cycles of length 1 or 2. A 5-cycle C_5 has chromatic number 3 and no triangles, and can serve as a finite illustration of this condition; it does NOT prove existence of a subgraph retaining an infinite chromatic cardinal. For r=5, the same C_5 fails because its five-cycle is prohibited.

What is known

The pinned provider google-deepmind/formal-conjectures@85f863718beeec7b58a3a1926ee92e3472bc2020 #740.lean directly encodes NoShortOddCycle via closed walks marked IsCycle and Odd length, requiring every such cycle length >r. The main theorem quantifies ℵ₀≤chromaticCardinal, all r∈ℕ (including r=0, which is vacuous), and an H subgraph of G with equal chromatic cardinal; its body is by sorry. The site's r≥1 and the formal file's r≥0 differ only by the vacuous zero case, not a proved counterexample. A May 2026 forum comment points to a set-theoretic consistency obstruction from related #1175 at m=aleph_1,r=3; this external comment has NOT been reconciled into the maintained OPEN label or independently proof-checked. Do not promote it as unconditional ZFC disproof or a verified solution.

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: maintained open vs may2026 forum set theoretic consistency obstruction claim; gcl pinned fc sorry; odd cycle cutoff not full girth. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

ERDOS-740-INFINITE_ODD_GIRTH_LOGIC. Source-check original Erdős–Hajnal text, Rödl's countable case, and the #1175 consistency result invoked in the May 2026 forum. Compare pinned Lean theorem including r=0 with maintained r≥1 and explain why it is only a semantic addition of a vacuous case. Record any relative-consistency obstruction with exact axioms, not a finite search result.

Sources and claim boundaries

Maintained Erdős #740; authenticated GCL source return; GCL-pinned statement. Historical full primary proofs have not been independently replayed. No real-browser mathematical rendering, protected batch merge 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: #2011 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned 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