On a Frankl-Rödl theorem and its geometric corollaries
From MaRDI portal
Publication:1690051
DOI10.1016/j.endm.2017.07.069zbMath1378.05072OpenAlexW2742377995MaRDI QIDQ1690051
Publication date: 18 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.069
Related Items (6)
Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of spheres ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ Counterexamples to Borsuk's conjecture with large girth
Cites Work
- Unnamed Item
- 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
- All regular polytopes are Ramsey
- Distance graphs with large chromatic numbers and small clique numbers
- Distance graphs with large chromatic number and arbitrary girth
- Graph Theory and Probability
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Forbidden Intersections
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space
- On the chromatic number of a space with forbidden equilateral triangle
- The realization of distances within sets in Euclidean space
This page was built for publication: On a Frankl-Rödl theorem and its geometric corollaries
