Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
From MaRDI portal
Publication:5396969
DOI10.1070/SM2013v204n10ABEH004345zbMath1303.05205MaRDI QIDQ5396969
Andrei M. Raigorodskii, Andrey B. Kupavskii
Publication date: 4 February 2014
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm2013v204n10abeh004345
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C12: Distance in graphs
05D10: Ramsey theory
Related Items
The chromatic number of space with forbidden regular simplex, On the chromatic numbers of rational spaces, Lower bounds for the chromatic numbers of distance graphs with large girth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- Intersection theorems with geometric consequences
- Distance graphs with large chromatic numbers and small clique numbers
- Distance graphs with large chromatic number and without large cliques
- The Difference Between Consecutive Primes, II
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Research Problems in Discrete Geometry
- The problems of Borsuk and Grunbaum on lattice polytopes
- The Mathematical Coloring Book
- On distance graphs with large chromatic number but without large simplices
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Forbidden Intersections
- On the chromatic number of a space
- The realization of distances within sets in Euclidean space
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- 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
