On the Number of Independent Sets in Simple Hypergraphs


Citar

Texto integral

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

Resumo

Extremal problems on the number of j-independent sets in uniform simple hypergraphs are studied. Nearly optimal results on the maximum number of independent sets for the class of simple regular hypergraphs and on the minimum number of independent sets for the class of simple hypergraphs with given average degree of vertices are obtained.

Sobre autores

A. Balobanov

Moscow Institute of Physics and Technology (State University)

Autor responsável pela correspondência
Email: balobanov@phystech.edu
Rússia, Dolgoprudnyi, Moscow Oblast

D. Shabanov

Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Department; National Research University Higher School of Economics

Email: balobanov@phystech.edu
Rússia, Dolgoprudnyi, Moscow Oblast; Moscow; Moscow

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

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