Skip to content

Erdős Problem #173

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, 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.

The question in plain language

Colour every point of the Euclidean plane red or blue. A triangle \(T\) is monochromatically realizable if the plane contains three points all of one colour forming a triangle congruent to \(T\), meaning all side lengths match.

Erdős #173 asks whether every two-colouring of the plane realizes all but at most one triangular shape in this way. The possible exceptional triangle may depend on the colouring, and “one triangle” means one congruence class of nondegenerate triangles, not one placement or one scale of all equilateral triangles.

A small example

Partition the plane into alternating red and blue parallel strips. Some prescribed equilateral triangles can fail to have a monochromatic congruent copy, which explains why the conjecture allows a single exceptional shape. The strip width and fixed side length matter: scaling the triangle changes the question, because congruence does not permit dilation.

A triangle is described up to congruence by its three side lengths, subject to the strict triangle inequalities. Reflecting or rotating it produces a congruent triangle.

What is known

The universal “at most one exception” assertion remains OPEN. The maintained Erdős #173 attributes to Shader (1976), All right triangles are Ramsey in \(E^2\)!, the result that any fixed right triangle must have a monochromatic congruent copy in every two-colouring of the plane. It is therefore not permissible to call an arbitrary right triangle a potential exception.

The site also cites the original 1975 Euclidean Ramsey theorem programme. Recent work on monochromatic collinear configurations or computational searches for plane colourings is related but does not certify this full geometric classification. The source page was last edited October 2025 and still reports the main problem as open.

GCL's current state

Pinned and maintained status: OPEN. Original issue: #1442. The protected provider lacks an admitted source statement for #173, so mathematical statement capture is required. Shader's theorem and the strip example are source-attributed; their proofs and any measurable/nonmeasurable colouring assumptions were not independently audited.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded geometric-semantics task formalizes congruence, two-colouring of all of \(\mathbb R^2\), and at most one excluded congruence class. A finite fixture should search a specified rational grid for congruent triangular point triples using squared distances, while expressly noting that finite-grid absence cannot disprove a plane-wide statement. Acceptance: no scaling is mistaken for congruence, and any full-plane proof remains outside the finite fixture.

Sources and claim boundaries

No solution of the plane-colouring conjecture, independent Shader proof or editorial admission is claimed.

Catalogue and evidence provenance

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