Lovász' theorem on the chromatic number of spheres revisited
The chromatic number of spheres \(\chi(S_r^{n-1})\) was introduced by Erdős in 1981 to be the minimum number of colors required to color all points of an \((n-1)\)-sphere \(S_r^{n-1}\) of radius \(r\) in \(\mathbb{R}^n\) so that no two points of the same color are distance 1 apart in the ambient Euclidean space \(\mathbb{R}^n\). The following is proved in this note. Let \(\omega\) be any function of a positive integer argument \(n\) which tends to infinity as \(n \to \infty\), and let \(r\) be any function of \(n\) taking a value at least \(\frac12 + \frac{\omega}{n}\) at each \(n\). Then \(\chi(S_{r(n)}^{n-1}) \to \infty\) as \(n \to \infty\). This result is slightly weaker than Lovász' earlier result that \(\chi(S_r^{n-1}) \geq n\) for any \(r > \frac12\) and any \(n\). Yet, the present proof is much shorter.
- scientific article; zbMATH DE number 5935733 (Why is no real title available?)
- scientific article; zbMATH DE number 3845607 (Why is no real title available?)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Lower bounds for measurable chromatic numbers
- On the stability of the independence number of a random subgraph
- A generalization of Kneser graphs
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- On lower bounds for the chromatic number of spheres
- On chromatic numbers of close-to-Kneser distance graphs
- On chromatic numbers of nearly Kneser distance graphs
- scientific article; zbMATH DE number 3989376 (Why is no real title available?)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic number of a random subgraph of the Kneser graph
- Strongly self-dual polytopes and distance graphs in the unit sphere
- On lower bounds for the chromatic number of sphere
This page was built for publication: Lovász' theorem on the chromatic number of spheres revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276666)
