Email this article On the Number of Independent Sets in Simple Hypergraphs
- Authors: Balobanov A.E.1, Shabanov D.A.1,2,3
-
Affiliations:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Department
- National Research University Higher School of Economics
- Issue: Vol 103, No 1-2 (2018)
- Pages: 33-41
- Section: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150512
- DOI: https://doi.org/10.1134/S0001434618010042
- ID: 150512
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. E. Balobanov
Moscow Institute of Physics and Technology (State University)
Author for correspondence.
Email: balobanov@phystech.edu
Russian Federation, Dolgoprudnyi, Moscow Oblast
D. A. Shabanov
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Department; National Research University Higher School of Economics
Email: balobanov@phystech.edu
Russian Federation, Dolgoprudnyi, Moscow Oblast; Moscow; Moscow
Supplementary files
