New bounds for the chromatic number of a space with forbidden isosceles triangles
From MaRDI portal
(Redirected from Publication:471374)
Cites work
- Borsuk's problem and the chromatic numbers of some metric spaces
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Chromatic numbers of spaces with forbidden monochromatic triangles
- Coloring distance graphs and graphs of diameters
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- On the chromatic number of a space
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Research Problems in Discrete Geometry
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The realization of distances within sets in Euclidean space
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)
