A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
From MaRDI portal
Publication:2313626
Recommendations
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- On the chromatic number for a set of metric spaces
- On the chromatic numbers of low-dimensional spaces
- The chromatic number of the space \(( {\mathbb R}^n, l_1)\)
Cites work
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 3458659 (Why is no real title available?)
- scientific article; zbMATH DE number 653246 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 1406330 (Why is no real title available?)
- Borsuk's problem and the chromatic numbers of some metric spaces
- Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Coloring distance graphs and graphs of diameters
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Combinatorial geometry and coding theory
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Exponentially Ramsey sets
- Finite Euclidean Ramsey theory
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Intersection theorems with geometric consequences
- Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- New lower bounds on $\chi(R^d)$ for $d=8 \dots 12$
- On a bound in extremal combinatorics
- On lower bounds for the chromatic number of sphere
- On the Frankl-Rödl theorem
- On the chromatic number of Euclidean space and the Borsuk problem
- On the chromatic number of Euclidean space with two forbidden distances
- On the chromatic number of \(\mathbb R^4\)
- On the chromatic number of a space
- On the chromatic number of a space with two forbidden distances
- On the chromatic number of an infinitesimal plane layer
- On the chromatic number of real and rational spaces
- On the chromatic number of with an arbitrary norm
- On the chromatic numbers of low-dimensional spaces
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the colouring of spheres embedded in \(\mathbb R^n\)
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
- On the space chromatic number
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- The chromatic number of \(\mathbb R^n\) with a set of forbidden distances
- The chromatic number of a space with the metric $ l_q$
- The realization of distances within sets in Euclidean space
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
Cited in
(24)- Isomorphism classes of distance graphs in \(\mathbb{Q}^3\)
- On the chromatic number of with an arbitrary norm
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- Covering planar sets
- On dividing sets into parts of smaller diameter
- 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\)
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- On the chromatic numbers corresponding to exponentially Ramsey sets
- All finite sets are Ramsey in the maximum norm
- Bounds on Borsuk numbers in distance graphs of a special type
- Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- Estimate of the number of edges in special subgraphs of a distance graph
- Counterexamples to Borsuk's conjecture with large girth
- On a Frankl-Wilson theorem
- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- Modularity of some distance graphs
- On stability of the independence number of a certain distance graph
- Modularity of some distance graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- Systems of representatives
This page was built for publication: A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313626)