On the measurable chromatic number of a space of dimension \(n \leq 24\)

DOI10.1134/S1064562415060344zbMath1334.05034MaRDI QIDQ265996

L. I. Bogolubsky, Andrei M. Raigorodskii

Publication date: 13 April 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Lebesgue measurable sets

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Turán-type bounds for distance graphs ⋮ Counterexamples to Borsuk's conjecture with large girth

Uses Software

• CVXOPT

Cites Work

• 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\)
• 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

This page was built for publication: On the measurable chromatic number of a space of dimension \(n \leq 24\)