Email this article On the number of edges in a uniform hypergraph with a range of permitted intersections
- Authors: Bobu A.V.1, Kupriyanov A.E.1, Raigorodskii A.M.1,2,3
-
Affiliations:
- Mechanics and Mathematics Faculty
- Moscow Institute of Physics and Technology (State University)
- Institute of Mathematics and Computer Science
- Issue: Vol 96, No 1 (2017)
- Pages: 354-357
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225237
- DOI: https://doi.org/10.1134/S1064562417040160
- ID: 225237
Cite item
Open Access
Access granted
Subscription Access
Abstract
The paper studies the quantity p(n, k, t1, t2) equal to the maximum number of edges in a k-uniform hypergraph with the property that the size of the intersection of any two edges lies in the interval [t1, t2]. Previously known upper and lower bounds are given. New bounds for p(n, k, t1, t2) are obtained, and the relationship between these bounds and known estimates is studied. For some parameter values, the exact values of p(n, k, t1, t2) are explicitly calculated.
About the authors
A. V. Bobu
Mechanics and Mathematics Faculty
Email: mraigor@yandex.ru
Russian Federation, Moscow, 119991
A. E. Kupriyanov
Mechanics and Mathematics Faculty
Email: mraigor@yandex.ru
Russian Federation, Moscow, 119991
A. M. Raigorodskii
Mechanics and Mathematics Faculty; Moscow Institute of Physics and Technology (State University); Institute of Mathematics and Computer Science
Author for correspondence.
Email: mraigor@yandex.ru
Russian Federation, Moscow, 119991; Dolgoprudnyi, Moscow oblast, 141700; Ulan-Ude, Buryat Republic, 670000
Supplementary files
