4 citations · 11 across the 8 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
The Hadwiger-Nelson problem with two forbidden distances
Geoffrey Exoo, Dan Ismailescu
In 1950 Edward Nelson asked the following simple-sounding question: \emph{How many colors are needed to color the Euclidean plane such that no two points distance $1…
math.CO2018
Bounds for the smallest -chromatic graphs of given girth
Geoffrey Exoo, Jan Goedgebeur
Let denote the smallest order of a -chromatic graph of girth at least . We consider the problem of determining for small values of and . After giving…
math.CO2018
The chromatic number of the plane is at least 5 - a new proof
Geoffrey Exoo, Dan Ismailescu
We present an alternate proof of the fact that given any 4-coloring of the plane there exist two points unit distance apart which are identically colored.