A coloring of the plane without monochromatic right triangles

2023/02/23 by Balázs Bursics, Bursics, Balázs, Péter Komjáth +1
Mathematics · #03E50 (Primary) 51M04 #05D10 (Secondary) #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Logic (math.LO) #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.2302.12215

openalex publication_date 2023/02/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give a full, correct proof of the following result, earlier claimed by Erdős and Komjáth. If the Continuum Hypothesis holds then there is a coloring of the plane with countably many colors, with no monocolored right triangle.

Related

• Triangle colorings require at least seven colors
• The chromatic number of the plane is at least 5 - a new proof
• On some problems of Euclidean Ramsey theory
• Coloring triangles and rectangles
• The chromatic number of the plane with an interval of forbidden distances is at least 7