Lovász' theorem on the chromatic number of spheres revisited

DOI10.1134/S0001434615090199zbMath1347.05076MaRDI QIDQ276666

Andrei M. Raigorodskii

Publication date: 4 May 2016

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Hamming spaceBoolean cubechromatic number of spheresErdős conjectureKnezer graphLovász theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Strongly self-dual polytopes and distance graphs in the unit sphere, On chromatic numbers of close-to-Kneser distance graphs, On chromatic numbers of nearly Kneser distance graphs, A generalization of Kneser graphs, On the stability of the independence number of a random subgraph, On the chromatic number of a random subgraph of the Kneser graph, 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

Cites Work

• 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
• Unnamed Item
• Unnamed Item