1,175 research outputs found
Chromatic number of Euclidean plane
If the chromatic number of Euclidean plane is larger than four, but it is
known that the chromatic number of planar graphs is equal to four, then how
does one explain it? In my opinion, they are contradictory to each other. This
idea leads to confirm the chromatic number of the plane about its exact value
Finite ε-unit distance graphs
In 2005, Exoo posed the following question. Fix with 0\leq\epsilon<1. Let be the graph whose vertex set is the Euclidean plane, where two vertices are adjacent iff the Euclidean distance between them lies in the closed interval . What is the chromatic number of this graph? The case is precisely the classical ``chromatic number of the plane'' problem. In a 2018 preprint, de Grey shows that ; the proof relies heavily on machine computation. In 2016, Grytczuk et al. proved a weaker result with a human-comprehensible but nonconstructive proof: whenever 0<\epsilon<1, we have that . (This lower bound of was later improved by Currie and Eggleton to .) The De Bruijn - Erd\H{o}s theorem (which relies on the axiom of choice) then guarantees the existence, for each , of a finite subgraph of such that . In this paper, we explicitly construct such finite graphs . We find that the number of vertices needed to create such a graph is no more than . Our proof can be done by hand without the aid of a computer
The Fractional Chromatic Number of the Plane
The chromatic number of the plane is the chromatic number of the uncountably
infinite graph that has as its vertices the points of the plane and has an edge
between two points if their distance is 1. This chromatic number is denoted
. The problem was introduced in 1950, and shortly
thereafter it was proved that . These bounds are
both easy to prove, but after more than 60 years they are still the best known.
In this paper, we investigate , the fractional chromatic
number of the plane. The previous best bounds (rounded to five decimal places)
were . Here we improve the lower
bound to .Comment: 20 pages, 10 figure
- …