On a Bound in Extremal Combinatorics

A new statement of a recent theorem of [1, 2] on the maximum number of edges in a hypergraph with forbidden cardinalities of edge intersections is given. This statement is fundamentally simpler than the original one, which makes it possible to obtain important corollaries in combinatorial geometry a...

Full description

Saved in:
Bibliographic Details
Published in:Doklady. Mathematics 2018, Vol.97 (1), p.47-48
Main Authors: Raigorodskii, A. M., Sagdeev, A. A.
Format: Article
Language:English
Subjects:
Combinatorial analysis
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:A new statement of a recent theorem of [1, 2] on the maximum number of edges in a hypergraph with forbidden cardinalities of edge intersections is given. This statement is fundamentally simpler than the original one, which makes it possible to obtain important corollaries in combinatorial geometry and Ramsey theory.
ISSN:1064-5624
1531-8362
DOI:10.1134/S1064562418010155