Отправить статью по E-mail On a Bound in Extremal Combinatorics
- Авторы: Raigorodskii A.1,2,3, Sagdeev A.1,2
-
Учреждения:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Faculty
- Institute of Mathematics and Computer Science
- Выпуск: Том 97, № 1 (2018)
- Страницы: 47-48
- Раздел: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225454
- DOI: https://doi.org/10.1134/S1064562418010155
- ID: 225454
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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.
Об авторах
A. Raigorodskii
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty; Institute of Mathematics and Computer Science
Автор, ответственный за переписку.
Email: mraigor@yandex.ru
Россия, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991; Ulan-Ude, Buryat Republic, 670000
A. Sagdeev
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty
Email: mraigor@yandex.ru
Россия, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991
