Improvements of the Frankl-Rödl theorem and geometric consequences
From MaRDI portal
Publication:2411792
DOI10.1134/S106456241704007XzbMath1373.05132OpenAlexW2753398736MaRDI QIDQ2411792
A. A. Sagdeev, R. I. Prosanov, Andrei M. Raigorodskii
Publication date: 25 October 2017
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s106456241704007x
Hypergraphs (05C65) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (14)
On a bound in extremal combinatorics ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the chromatic numbers of some distance graphs ⋮ Exponentially Ramsey sets ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ On lower bounds for the chromatic number of spheres ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Counterexamples to Borsuk's conjecture with large girth
Cites Work
- Unnamed Item
- 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
- Euclidean Ramsey theorems. I
- Distance graphs with large chromatic number and arbitrary girth
- On the chromatic number of a space with a forbidden regular simplex
- Lower bounds for the chromatic numbers of distance graphs with large girth
- A Partition Property of Simplices in Euclidean Space
- The Mathematical Coloring Book
- Forbidden Intersections
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space with forbidden equilateral triangle
This page was built for publication: Improvements of the Frankl-Rödl theorem and geometric consequences
