On the chromatic numbers of low-dimensional spaces
From MaRDI portal
Publication:2358584
Recommendations
Cites work
- An estimate for the chromatic number of the space $ \mathbb R^4$
- Borsuk's problem and the chromatic numbers of some metric spaces
- Finite Euclidean Ramsey theory
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Independence numbers of random subgraphs of a distance graph
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the chromatic number of \(\mathbb{R}^{9}\)
- On the chromatic number of with an arbitrary norm
- On the colouring of spheres embedded in R^n
- On the space chromatic number
- The realization of distances within sets in Euclidean space
Cited in
(34)- On a bound in extremal combinatorics
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- On the chromatic numbers of some distance graphs
- Chromatic numbers of spheres
- On the space chromatic number
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Independence numbers of random subgraphs of some distance graph
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Estimate of the number of edges in special subgraphs of a distance graph
- A generalization of Kneser graphs
- On the chromatic numbers corresponding to exponentially Ramsey sets
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- On threshold probability for the stability of independent sets in distance 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
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- The number of edges in induced subgraphs of some distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Counterexamples to Borsuk's conjecture with large girth
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- Turán-type results for distance graphs in an infinitesimal plane layer
- On the measurable chromatic number of a space of dimension \(n \leq 24\)
- Borsuk's problem and the chromatic numbers of metric spaces
- On the chromatic number of real and rational spaces
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- A new lower bound for the chromatic number of the rational space
- On low rank-width colorings
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
- The chromatic number of space with forbidden regular simplex
- On the chromatic number of a random subgraph of the Kneser graph
This page was built for publication: On the chromatic numbers of low-dimensional spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358584)