On the chromatic numbers of small-dimensional Euclidean spaces
DOI10.1016/j.endm.2009.07.072zbMath1273.05073arXiv1512.03472OpenAlexW2962871181MaRDI QIDQ5891225
Andrey B. Kupavskii, Andrei M. Raigorodskii, Danila Cherkashin, Anatoly Kulikov
Publication date: 10 October 2013
Published in: Discrete Applied Mathematics, Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.03472
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (28)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the chromatic number of \(\mathbb R^4\)
- On the chromatic number of with an arbitrary norm
- Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- A 15-colouring of 3-space omitting distance one
- On the space chromatic number
- Finite Euclidean Ramsey theory
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring some finite sets in {R}^{n}
- Research Problems in Discrete Geometry
- On the colouring of spheres embedded in $ \mathbb R^n$
- New lower bounds on $\chi(R^d)$ for $d=8 \dots 12$
- On the chromatic number of a space
- Counting Intersecting and Pairs of Cross-Intersecting Families
- Combinatorial Geometry and Coding Theory*
- The realization of distances within sets in Euclidean space
- Algorithm 457: finding all cliques of an undirected graph
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: On the chromatic numbers of small-dimensional Euclidean spaces