Skip to content

Erdős Problem #1168

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (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 #1168 is classified OPEN in the maintained catalogue.

For the first uncountable successor above the singular limit \(\mu=\aleph_\omega\), let \(\kappa=\aleph_{\omega+1}\). The problem asks for a proof without the generalized continuum hypothesis of the negative partition relation

\[ \kappa\not\to(\kappa,3,3,\ldots)_{\aleph_0}^{2}. \]

This means constructing a countably colored complete graph on \(\kappa\) vertices with no homogeneous subset of size \(\kappa\) in the distinguished color and no monochromatic triangle in any other color. A coloring with one unique color per pair on a finite graph is not an infinite/countable-color disproof: \(\kappa\) has far more than countably many pairs.

A small example

For the seven-vertex complete graph, assign each of its 21 edges a distinct color. Every triangle has three differently colored edges, exactly checked by the phase-20 fixture. It illustrates negative monochromatic-triangle avoidance, but uses 21 colors and does not force the distinguished color to avoid a \(\kappa\)‑set in an infinite graph. There is no finite analogue of the cardinal-arithmetic obstruction that would prove the theorem.

What is known

Erdős–Hajnal–Rado [EHR65] proved the stated negative relation under GCH, as reported by Erdős–Hajnal [ErHa71,p.21], Vardi [Va99,7.80] and Komjáth [Ko25b,p.3]. The maintained catalogue marks the unrestricted-from-GCH assertion OPEN. A theorem under GCH cannot simply be read as a ZFC proof; the required strengthening is precisely removal of that extra axiom. The meaning of the \(\aleph_0\)‑indexed list and the distinction between negative and positive arrow are essential.

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

Consult EHR65 and ErHa71 original pages, source-lock the color indexing and \(\kappa\) definitions, and identify exactly where \(2^\lambda=\lambda^+\) under GCH is used in the construction. Seek an absolute construction or isolate additional weak hypotheses without incorrectly calling GCH-conditional a proof in ZFC.

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/1168 ; [ErHa71,p.21],[EHR65],[Va99,7.80],[Ko25b,p.3].

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: #2439 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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