电邮这篇文章 On the Number of Independent Sets in Simple Hypergraphs
- 作者: Balobanov A.E.1, Shabanov D.A.1,2,3
-
隶属关系:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Department
- National Research University Higher School of Economics
- 期: 卷 103, 编号 1-2 (2018)
- 页面: 33-41
- 栏目: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150512
- DOI: https://doi.org/10.1134/S0001434618010042
- ID: 150512
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
A. Balobanov
Moscow Institute of Physics and Technology (State University)
编辑信件的主要联系方式.
Email: balobanov@phystech.edu
俄罗斯联邦, 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
俄罗斯联邦, Dolgoprudnyi, Moscow Oblast; Moscow; Moscow
补充文件
