Email this article On a Bound in Extremal Combinatorics
- Authors: Raigorodskii A.M.1,2,3, Sagdeev A.A.1,2
-
Affiliations:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Faculty
- Institute of Mathematics and Computer Science
- Issue: Vol 97, No 1 (2018)
- Pages: 47-48
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225454
- DOI: https://doi.org/10.1134/S1064562418010155
- ID: 225454
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. M. Raigorodskii
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty; Institute of Mathematics and Computer Science
Author for correspondence.
Email: mraigor@yandex.ru
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991; Ulan-Ude, Buryat Republic, 670000
A. A. Sagdeev
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty
Email: mraigor@yandex.ru
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991
Supplementary files
