On the measurable chromatic number of a space of dimension n 24
From MaRDI portal
Publication:265996
DOI10.1134/S1064562415060344zbMATH Open1334.05034MaRDI QIDQ265996FDOQ265996
Authors: L. I. Bogolubsky, Andrei M. Raigorodskii 
Publication date: 13 April 2016
Published in: Doklady Mathematics (Search for Journal in Brave)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The realization of distances in measurable subsets covering \(R^ n\).
- The density of sets avoiding distance 1 in Euclidean space
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- The Mathematical Coloring Book
- On the chromatic number of a space
- On a bound in Borsuk's problem
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
- Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
Cited In (4)
Uses Software
This page was built for publication: On the measurable chromatic number of a space of dimension \(n \leq 24\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265996)
