On the number of edges in a uniform hypergraph with a range of permitted intersections


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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.

Sobre autores

A. Bobu

Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
Rússia, Moscow, 119991

A. Kupriyanov

Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
Rússia, Moscow, 119991

A. Raigorodskii

Mechanics and Mathematics Faculty; Moscow Institute of Physics and Technology (State University); Institute of Mathematics and Computer Science

Autor responsável pela correspondência
Email: mraigor@yandex.ru
Rússia, Moscow, 119991; Dolgoprudnyi, Moscow oblast, 141700; Ulan-Ude, Buryat Republic, 670000

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2017