On the chromatic numbers of rational spaces
From MaRDI portal
Publication:1646347
DOI10.1134/S0001434618010133zbMath1392.05042OpenAlexW2792407815MaRDI QIDQ1646347
Publication date: 25 June 2018
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434618010133
Cites Work
- Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra
- Distance graphs with large chromatic numbers and small clique numbers
- Additive \(k\)-colorable extensions of the rational plane
- A 15-colouring of 3-space omitting distance one
- On the space chromatic number
- Embedding a polytope in a lattice
- Distance graphs with large chromatic number and arbitrary girth
- Distance graphs with large chromatic number and without large cliques
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On the chromatic number of subsets of the Euclidean plane
- Two notions of unit distance graphs
- Distances realized by sets covering the plane
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Small clique and large chromatic number
- Research Problems in Discrete Geometry
- Graph Theory and Probability
- The Mathematical Coloring Book
- On distance graphs with large chromatic number but without large simplices
- On the chromatic number of a space
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- The realization of distances within sets in Euclidean space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the chromatic numbers of rational spaces
