Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
From MaRDI portal
Publication:762489
DOI10.1007/BF02579223zbMath0558.05020MaRDI QIDQ762489
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579223
05C15: Coloring of graphs and hypergraphs
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
Related Items
Geometrical sets with forbidden configurations, Better bounds for planar sets avoiding unit distances, Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\), The fractional chromatic number of the plane, Bounds on the measurable chromatic number of \({\mathbb{R}}\), Same graph, different universe, Winning Fast in Sparse Graph Construction Games
Cites Work