New lower bound for the chromatic number of a rational space with one and two forbidden distances
DOI10.1134/S0001434615010265zbMATH Open1317.05064MaRDI QIDQ2353733FDOQ2353733
Authors: E. I. Ponomarenko, Andrei M. Raigorodskii 
Publication date: 16 July 2015
Published in: Mathematical Notes (Search for Journal in Brave)
Recommendations
- A new lower bound for the chromatic number of the rational space
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
- On the chromatic numbers of metric spaces with few forbidden distances
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- On the Chromatic Numbers of and with Intervals of Forbidden Distances
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
chromatic numberStirling's formulaNelson-Hadwiger problemindependence number of a graphrational space with forbidden distances
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Research Problems in Discrete Geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- The Mathematical Coloring Book
- On the chromatic number of a space
- The realization of distances within sets in Euclidean space
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- On the chromatic number of a space with two forbidden distances
- On the chromatic number of with an arbitrary norm
Cited In (12)
- On the chromatic number of an infinitesimal plane layer
- On a bound in extremal combinatorics
- On the chromatic numbers of rational spaces
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- Chromatic numbers of spheres
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Isomorphism classes of distance graphs in \(\mathbb{Q}^3\)
- Turán-type bounds for distance graphs
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
This page was built for publication: New lower bound for the chromatic number of a rational space with one and two forbidden distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353733)
