On the measurable chromatic number of a space of dimension n 24
From MaRDI portal
(Redirected from Publication:265996)
On the measurable chromatic number of a space of dimension \(n \leq 24\)
On the measurable chromatic number of a space of dimension \(n \leq 24\)
Recommendations
Cites work
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
- New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
- On a bound in Borsuk's problem
- 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
- On the chromatic number of a space
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
- The Mathematical Coloring Book
- The density of sets avoiding distance 1 in Euclidean space
- The realization of distances in measurable subsets covering R^ n.
Cited in
(5)
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)
