On the chromatic numbers of low-dimensional spaces
From MaRDI portal
Publication:2358584
DOI10.1134/S106456241701001XzbMath1365.05085MaRDI QIDQ2358584
Danila Cherkashin, Andrei M. Raigorodskii
Publication date: 15 June 2017
Published in: Doklady Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
Turán-type results for distance graphs in an infinitesimal plane layer, On a bound in extremal combinatorics, Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors, 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, First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees, On the chromatic numbers corresponding to exponentially Ramsey sets, On the chromatic numbers of some distance graphs, The chromatic number of space with forbidden regular simplex, On the chromatic number of a random subgraph of the Kneser graph, Chromatic numbers of spheres, 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, Chromatic numbers of distance graphs without short odd cycles in rational spaces, 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 \(\ell_1\) and \(\ell_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
Cites Work
- Independence numbers of random subgraphs of a distance graph
- On the chromatic number of with an arbitrary norm
- On the space chromatic number
- Finite Euclidean Ramsey theory
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the chromatic number of \(\mathbb{R}^{9}\)
- Borsuk's problem and the chromatic numbers of some metric spaces
- On the colouring of spheres embedded in $ \mathbb R^n$
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- An estimate for the chromatic number of the space $ \mathbb R^4$
- The realization of distances within sets in Euclidean space
