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

zbMATH Keywords

independence numberchromatic numberchromatic numbersdistance graphs

Mathematics Subject Classification ID

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)

On the chromatic number of an infinitesimal plane layer ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ Coloring distance graphs on the plane ⋮ On a Frankl-Wilson theorem ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ Independence numbers of Johnson-type graphs ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the chromatic numbers of some distance graphs ⋮ On the Frankl–Rödl theorem ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ Chromatic numbers of Kneser-type graphs ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ On lower bounds for the chromatic number of spheres ⋮ Clique chromatic numbers of intersection graphs ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ All finite sets are Ramsey in the maximum norm

Uses Software

• Algorithm 457

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