On the Number of Independent Sets in Simple Hypergraphs
- Autores: Balobanov A.E.1, Shabanov D.A.1,2,3
-
Afiliações:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Department
- National Research University Higher School of Economics
- Edição: Volume 103, Nº 1-2 (2018)
- Páginas: 33-41
- Seção: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150512
- DOI: https://doi.org/10.1134/S0001434618010042
- ID: 150512
Citar
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.
Palavras-chave
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
