Improvements of the Frankl–Rödl theorem and geometric consequences

The Frankl–Rödl classical bound for the number of edges in a hypergraph with forbidden intersections is improved. The improvements are used to obtain new results in Euclidean Ramsey theory and in combinatorial geometry.

Saved in:
Bibliographic Details
Published in:Doklady. Mathematics 2017-07, Vol.96 (1), p.336-338
Main Authors: Prosanov, R. I., Raigorodskii, A. M., Sagdeev, A. A.
Format: Article
Language:English
Subjects:
Combinatorial analysis
Euclidean geometry
Intersections
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Frankl–Rödl classical bound for the number of edges in a hypergraph with forbidden intersections is improved. The improvements are used to obtain new results in Euclidean Ramsey theory and in combinatorial geometry.
ISSN:1064-5624
1531-8362
DOI:10.1134/S106456241704007X