The problems of Borsuk and Grunbaum on lattice polytopes
From MaRDI portal
Publication:3372463
DOI10.1070/IM2005v069n03ABEH000537zbMath1153.52301OpenAlexW2061785157MaRDI QIDQ3372463
Publication date: 21 February 2006
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/im2005v069n03abeh000537
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Ramsey theory (05D10) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Combinatorial aspects of packing and covering (05B40)
Related Items
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, On the stability of the Erdös-Ko-Rado theorem, Distance graphs with large chromatic numbers and small clique numbers, On the multiple Borsuk numbers of sets, Hamiltonian paths in distance graphs, Systems of representatives, Small Subgraphs in Random Distance Graphs, New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs, Zero-one laws for random graphs with vertices in a Boolean cube, New upper bound for the chromatic number of a random subgraph of a distance graph, Independence numbers and chromatic numbers of some distance graphs
