Lower bounds for the measurable chromatic number of the hyperbolic plane
DOI10.1007/s00454-018-0027-8zbMath1417.05063arXiv1708.01081OpenAlexW2743143360MaRDI QIDQ2316800
Evan DeCorte, Konstantin Golubev
Publication date: 7 August 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.01081
infinite graphhyperbolic geometryHadwiger-Nelson problemHoffman boundFourier methodsmeasurable chromatic number
Hyperbolic and elliptic geometries (general) and generalizations (51M10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Better bounds for planar sets avoiding unit distances
- A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
- Spectral bounds for the independence ratio and the chromatic number of an operator
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Lower bounds for measurable chromatic numbers
- The realization of distances in measurable subsets covering \(R^ n\).
- Intersection theorems with geometric consequences
- The density of sets avoiding distance 1 in Euclidean space
- The Hadwiger–Nelson Problem
- Coloring distance graphs: a few answers and many questions
- Spherical Sets Without Orthogonal Point Pairs
- On the Shannon capacity of a graph
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- Spherical Sets Avoiding a Prescribed Set of Angles
- Generalized Helgason-Fourier transforms associated to variants of the Laplace-Beltrami operators on the unit ball in $\mathbb{R}^{n}$
This page was built for publication: Lower bounds for the measurable chromatic number of the hyperbolic plane
