Skip to content

Erdős Problem #736

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

Given a graph G that needs ℵ₁ colours, is it possible to build a graph of every cardinal chromatic number m while using only finite graph patterns that already occur in G? This is Walter Taylor's question, Erdős #736. The maintained source labels the universal statement NOT PROVABLE.

A small example

A triangle-free graph has no triangle among any of its finite subgraphs; a graph that uses only its finite patterns must also be triangle-free. This illustrates the meaning of pattern containment, but finite triangle-freeness alone says nothing about arbitrarily high cardinal chromatic numbers.

What is known

The maintained source credits Komjáth–Shelah [KoSh05] with a relative-consistency result: in a suitable model there is an ℵ₁-chromatic graph G whose finite-subgraph patterns cannot be realized by any graph H with chromatic number exceeding ℵ₂. Therefore the unconditional demand for every cardinal m fails in that model. This is a model-theoretic not-provable result, not an elementary finite counterexample or a proof that the statement fails under every possible set-theoretic axiom system.

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: komjath shelah relative consistency negative; not unconditional zfc proof of negation. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Identify the exact background axioms and forcing conditions in Komjáth–Shelah 2005 and distinguish subgraph-pattern containment from induced-pattern containment. Any source-critical review must track which cardinals and universes are being quantified before protected admission.

Sources and claim boundaries

Maintained #736; original source report; KoSh05 original complete proof uninspected. No new consistency result, protected 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: #2007 — 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