电邮这篇文章 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
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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
补充文件
