Мақаланы E-mail арқылы жіберу On a Bound in Extremal Combinatorics
- Авторлар: Raigorodskii A.M.1,2,3, Sagdeev A.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
Қосымша файлдар
