Skip to content

Erdős Problem #1174

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: not disprovable (not automatically the live result).
Subject areas: set theory, ramsey theory.

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.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Erdős Problem #1174 is classified NOT DISPROVABLE in the maintained catalogue.

Two distinct infinite-graph edge-Ramsey questions are posed. First: can a \(K_4\)‑free graph \(G\) have the property that every edge coloring with countably many available colors produces a monochromatic \(K_3\)? Second: can a graph with no clique of cardinality \(\aleph_1\) force a monochromatic countable clique \(K_{\aleph_0}\) under every countable edge coloring? Both quantify over all countable colorings; existence of one coloring avoiding the specified homogeneous clique refutes a candidate. Do not confuse vertex chromatic number with coloring the edges.

A small example

No finite graph can satisfy the first edge-Ramsey condition with countably many colors: color every edge differently. This uses finitely, hence countably, many colors and prevents any monochromatic triangle. The fixture checks this on all 15 edges of \(K_6\) and separately constructs the bipartite nine-edge graph \(K_{3,3}\), which is \(K_4\)‑free. These elementary finite obstructions only show genuinely infinite graphs are essential. For an uncountable graph, distinct colors per edge may exceed the allowed countable palette.

What is known

The maintained page cites Vardi [Va99,7.91] and attributes to Shelah a relative-consistency construction of graphs having the requested properties. Its NOT DISPROVABLE status is conditional-model evidence, not an unconditional ZFC existence proof or a theorem of full independence. The bibliographic identity and precise forcing assumptions of Shelah's argument need original-source examination, including whether the two graph properties are established under identical hypotheses. Their forbidden and forced clique cardinalities are very different.

GCL's current state

GCL posted an authenticated issue-bound research return and independently reproduced only the explicitly finite checks in ci/erdos_compendium_007_phase20_checks.py. This is an unaccepted editorial explanation, not an independent primary-paper verification or theorem proof.

What remains

Identify Shelah's original primary theorem and the forcing consistency strength of each case; verify 'countably many colors' versus 'arbitrary at most countably many' and the precise graph cardinalities. Prove the finite unique-color obstruction as a normalization example only; do not generalize it by assigning uncountably many colors in a countably-colored infinite context.

The source-status and theorem-strength distinctions must be settled before final protected admission. The cohort still has mandatory independent critical-review obligations.

Sources and claim boundaries

https://www.erdosproblems.com/1174 ; [Va99,7.91], Shelah as cited (primary theorem/pages pending).

Phase20 exact receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE20.json. Source-fidelity PENDING; protected publication and V2 NOT ADMITTED.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2445 — 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