The chromatic number of the plane is at least 5 -- a human-veriviable proof

MaRDI QIDQ3387384zbMATH OpenFDO

Authors Jaan Parts

Publication date 12 January 2021

Full work available at URL https://arxiv.org/abs/2010.12661

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: We present a new proof of the known fact that the chromatic number of the plane is at least 5. The main difference of this proof is that it can be verified manually without the help of the computer.

Recommendations

• The chromatic number of the plane is at least 5: a new proof
• The chromatic number of the plane is at least 5
• A 6-chromatic two-distance graph in the plane
• A small 6-chromatic two-distance graph in the plane
• Almost-monochromatic sets and the chromatic number of the plane

Cited in

(7)

• Almost-monochromatic sets and the chromatic number of the plane
• Almost-monochromatic sets and the chromatic number of the plane
• The chromatic number of the plane is at least 5: a new proof
• Coloring distance graphs on the plane
• Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
• Proof pearl: a probabilistic proof for the girth-chromatic number theorem
• The chromatic number of the plane is at least 5

This page was built for publication: The chromatic number of the plane is at least 5 -- a human-veriviable proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387384)