The chromatic number of space with forbidden regular simplex
From MaRDI portal
Publication:679877
DOI10.1134/S0001434617090267zbMath1386.05066OpenAlexW2765239708MaRDI QIDQ679877
Publication date: 22 January 2018
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434617090267
Related Items (4)
Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ On the Frankl–Rödl theorem ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Counterexamples to Borsuk's conjecture with large girth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds for the chromatic number of a space with forbidden isosceles triangles
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- 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
- Intersection theorems with geometric consequences
- Distance graphs with large chromatic numbers and small clique numbers
- Distance graphs with large chromatic number and arbitrary girth
- Distance graphs with large chromatic number and without large cliques
- On the chromatic numbers of low-dimensional spaces
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Two notions of unit distance graphs
- The Difference Between Consecutive Primes, II
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Small clique and large chromatic number
- Research Problems in Discrete Geometry
- A Partition Property of Simplices in Euclidean Space
- The Mathematical Coloring Book
- On distance graphs with large chromatic number but without large simplices
- All Triangles are Ramsey
- Forbidden Intersections
- On the chromatic number of a space
- On the chromatic number of a space with forbidden equilateral triangle
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- The realization of distances within sets in Euclidean space
This page was built for publication: The chromatic number of space with forbidden regular simplex
