pith. sign in

arxiv: 1509.01595 · v2 · pith:GIAHVMFTnew · submitted 2015-09-04 · 🧮 math.CO

The vector graph and the chromatic number of the plane, or how NOT to prove that chi(mathbb{E}²)>4

classification 🧮 math.CO
keywords chromaticleftmathcalnumberplaneproverightbound
0
0 comments X
read the original abstract

The chromatic number $\chi\left(\mathcal{E^2}\right)$ of the plane is known to be some integer between 4 and 7, inclusive. We prove a limiting result that says, roughly, that one cannot increase the lower bound on $\chi\left(\mathcal{E^2}\right)$ by pasting Moser Spindles together, even countably many.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.