Excluding bichromatic vertices
From Polymath Wiki
Theorem 1 A 4-coloring of the unit plane cannot contain a bichromatic vertex (a vertex that can be colored in either of two colors while keeping the color of all other vertices fixed).
Proof
Theorem 1 A 4-coloring of the unit plane cannot contain a bichromatic vertex (a vertex that can be colored in either of two colors while keeping the color of all other vertices fixed).
Proof