Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
From MaRDI portal
Publication:483655
DOI10.1134/S1064562414050068zbMath1306.05174MaRDI QIDQ483655
A. E. Zvonarev, A. A. Kharlamova, D. V. Samirov, Andrei M. Raigorodskii
Publication date: 17 December 2014
Published in: Doklady Mathematics (Search for Journal in Brave)
Related Items
Lower bounds for the chromatic numbers of distance graphs with large girth, Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets, Improvements of the Frankl-Rödl theorem and geometric consequences, On a Frankl-Rödl theorem and its geometric corollaries, 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, The chromatic number of space with forbidden regular simplex
Cites Work
- Unnamed Item
- Unnamed Item
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic number of a space with two forbidden distances
- On the chromatic numbers of spheres in Euclidean spaces
- Chromatic numbers of spaces with forbidden monochromatic triangles
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Forbidden Intersections
