Lower bounds for the measurable chromatic number of the hyperbolic plane
arXiv:1708.01081 · doi:10.1007/s00454-018-0027-8
Abstract
Consider the graph whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some . Asking for the chromatic number of this graph is the hyperbolic analogue to the famous Hadwiger-Nelson problem about colouring the points of the Euclidean plane so that points at distance receive different colours. As in the Euclidean case, one can lower bound the chromatic number of by for all . Using spectral methods, we prove that if the colour classes are measurable, then at least colours are are needed to properly colour when is sufficiently large.
arXiv comment13 pages, 2 figures
References in corpus (7)
- Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
- Lower bounds for measurable chromatic numbers
- Spectral bounds for the independence ratio and the chromatic number of an operator
- Better bounds for planar sets avoiding unit distances
- Coloring distance graphs: a few answers and many questions
- A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
- Chromatic numbers for the hyperbolic plane and discrete analogs