arXiv (All)
open access
A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles
Erdős and Graham asked whether every finite coloring of the plane must contain a monochromatic rectangle of any prescribed area. Kovač gave a negative answer by constructing a $25$-coloring with no monochromatic rectangle of area $1$. We reduce the number of colors to $21$ by replacing the square ce
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect Rectangular Tilings with Two Colors#1061927
- The Four Color Theorem meets Shapes of Polyhedra#1118521
- From semi-total to equitable total colorings#144268
- From the four-color theorem to a generalizing “four-letter theorem”: A sketch for “human proof” and the philosophical interpretation#759758
- Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra#144227
Record · ID 820016
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive