Keywords:
chromatic number of spheres, Lovász' theorem, Erdős' conjecture on the chromatic number of spheres, Knezer graph, Hamming space, Boolean cube.
This work was supported by the Russian Foundation for Basic Research under grant 15-01-03530, by the program for government support of young Russian scientists under grant MD-6008.2015.1, and by the program "Leading Scientific Schools" under grant NSh-2964.2014.1.
Citation:
A. M. Raigorodskii, “Lovász' Theorem on the Chromatic Number of Spheres Revisited”, Mat. Zametki, 98:3 (2015), 470–471; Math. Notes, 98:3 (2015), 522–524
This publication is cited in the following 10 articles:
Horvath A.G., “Strongly Self-Dual Polytopes and Distance Graphs in the Unit Sphere”, Acta Math. Hung., 163:2 (2021), 640–651
A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “A Generalization of Kneser Graphs”, Math. Notes, 107:3 (2020), 392–403
O. A. Kostina, “On Lower Bounds for the Chromatic Number of Spheres”, Math. Notes, 105:1 (2019), 16–27
Yu. A. Demidovich, “Distance Graphs with Large Chromatic Number and without Cliques of Given Size in the Rational Space”, Math. Notes, 106:1 (2019), 38–51
A. M. Raigorodskii, “On the stability of the independence number of a random subgraph”, Dokl. Math., 96:3 (2017), 628–630
S. G. Kiselev, A. M. Raigorodskii, “On the chromatic number of a random subgraph of the Kneser graph”, Dokl. Math., 96:2 (2017), 475–476