Skip to content

Erdős Problem #189

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (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 all points of the plane with finitely many colours. Erdős and Graham asked whether some colour class must contain vertices of a rectangle of every prescribed positive area. The rectangle may translate and rotate, and its side lengths may vary as long as their product is the required area.

This is stronger than forcing one congruence class of rectangles and different from asking for an axis-aligned rectangle only. Its quantifiers ask that, for every colouring and every target area, some colour class realizes that area; a single colouring avoiding one area disproves the universal statement.

A small example

A rectangle with perpendicular side vectors \(u,v\) has four vertices \(x\), \(x+u\), \(x+v\), \(x+u+v\) and area \(|u||v|\). The square with vertices \((0,0),(1,0),(0,1),(1,1)\) has area one. Proving that a finite colouring avoids every such rectangle of area one requires checking all translations and rotations, not just the unit grid.

Rescaling the whole plane changes rectangle areas quadratically, so a construction forbidding unit area can be rescaled to forbid any other single prescribed positive area. This does not imply a single colouring can exclude every area simultaneously.

What is known

DISPROVED. Vjekoslav Kovač, Coloring and density theorems for configurations of a given volume, constructed a 25-colouring of the plane with no monochromatic rectangle of area one (Theorem 3). The journal version, Proceedings of the London Mathematical Society, supplies an explicit construction. Its proof uses an alternating quadratic complex-coordinate invariant for parallelograms.

A newer improvement by Gary Hu and Yumo Liu, A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles (September 2026), replaces Kovač's square tiling by hexagonal cells and reduces the stated number of colours to 21. This is an external preprint claim, not an independently reproduced construction. The disproof is already complete with 25 colours regardless of its verification.

The related question for parallelograms of every prescribed area remains distinct, as does Graham's positive theorem for right triangles. The maintained Erdős #189 labels the original rectangle statement DISPROVED (LEAN).

GCL's current state

Pinned and maintained status: DISPROVED. Original issue: #1458. A statement exists in the locked provider snapshot, but externally reported Lean status was not kernel-replayed by GCL. The 2026 improvement is dated and has not replaced the protected historical proof.

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 task verifies the finite colouring rule of Kovač's Theorem 3, proving that any monochromatic parallelogram has consecutive side-length product different from one. Acceptance: the exact 25-colour function, the quadratic invariant, and the all-translations/all-rotations quantifiers are checked; a separate comparison can examine the 21-colour refinement. Stop before claiming an independent formal certification.

Sources and claim boundaries

No new countercolouring, GCL Lean certificate or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1458 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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