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/S1064562414050068zbMATH Open1306.05174MaRDI QIDQ483655FDOQ483655
Authors: A. E. Zvonarev, D. V. Samirov, A. A. Kharlamova, Andrei M. Raigorodskii 
Publication date: 17 December 2014
Published in: Doklady Mathematics (Search for Journal in Brave)
Recommendations
- Improvements of the Frankl-Rödl theorem and geometric consequences
- 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
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- An extension of a Frankl-Füredi theorem
- Improved Frankl-Rödl theorem and some of its geometric consequences
Cites Work
- Research Problems in Discrete Geometry
- Forbidden Intersections
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- The Mathematical Coloring Book
- Title not available (Why is that?)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- Title not available (Why is that?)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Chromatic numbers of spaces with forbidden monochromatic triangles
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- On the chromatic number of a space with two forbidden distances
Cited In (9)
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- On a bound in extremal combinatorics
- On a Frankl-Rödl theorem and its geometric corollaries
- Improvements of the Frankl-Rödl theorem and geometric consequences
- 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
- Frankl-Rödl-type theorems for codes and permutations
- 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
This page was built for publication: Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483655)
