Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
From MaRDI portal
(Redirected from Publication:5396969)
Recommendations
- On the structure of distance graphs with large chromatic numbers
- On the structure of distance graphs with a large chromatic number
- Distance graphs with large chromatic number and arbitrary girth
- On large subgraphs with small chromatic numbers contained in distance graphs
- scientific article; zbMATH DE number 57114
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- On the chromatic numbers of some distance graphs
- On distance Laplacian spectral radius and chromatic number of graphs
- On large subgraphs of a distance graph which have small chromatic number
Cites work
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Distance graphs with large chromatic number and without large cliques
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Forbidden Intersections
- scientific article; zbMATH DE number 6009961 (Why is no real title available?)
- scientific article; zbMATH DE number 3845607 (Why is no real title available?)
- scientific article; zbMATH DE number 51916 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 3432285 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3098608 (Why is no real title available?)
- Intersection theorems with geometric consequences
- On distance graphs with large chromatic number but without large simplices
- On the chromatic number of a space
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- Research Problems in Discrete Geometry
- The difference between consecutive primes. II
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Mathematical Coloring Book
- The problems of Borsuk and Grunbaum on lattice polytopes
- The realization of distances within sets in Euclidean space
- 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
Cited in
(7)- On the chromatic numbers of rational spaces
- Lower bounds for the chromatic numbers of distance graphs with large girth
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Ball packings with high chromatic numbers from strongly regular graphs
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- The chromatic number of space with forbidden regular simplex
- On the structure of distance graphs with large chromatic numbers
This page was built for publication: Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396969)