New bounds for the chromatic number of a space with forbidden isosceles triangles
From MaRDI portal
Publication:471374
DOI10.1134/S1064562414030144zbMATH Open1303.05068MaRDI QIDQ471374FDOQ471374
Authors: D. V. Samirov, Andrei M. Raigorodskii 
Publication date: 14 November 2014
Published in: Doklady Mathematics (Search for Journal in Brave)
Cites Work
- Research Problems in Discrete Geometry
- The complete nontrivial-intersection theorem for systems of finite sets
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- On the chromatic number of a space
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- The realization of distances within sets in Euclidean space
- On the chromatic numbers of spheres in Euclidean spaces
- The complete intersection theorem for systems of finite sets
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Chromatic numbers of spaces with forbidden monochromatic triangles
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
Cited In (5)
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- On the chromatic numbers corresponding to exponentially Ramsey sets
- The chromatic number of space with forbidden regular simplex
This page was built for publication: New bounds for the chromatic number of a space with forbidden isosceles triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471374)
