Extremal problems related to Betti numbers of flag complexes
Extremal problems related to Betti numbers of flag complexes
复制标题
与标志复合体 Betti 数相关的极值问题
DOI:
10.1016/j.dam.2014.04.006
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Michał
中科院分区:
文献类型:
--
作者:
Adamaszek;Michał
We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.3 2 n for the sum of Betti numbers of any n-vertex flag complex and 1.2 5 n for the independence complex of a triangle-free graph. These findings imply upper bounds for the Betti numbers of various related classes of spaces, including the neighbourhood complex of a graph. We also make some related observations.
登录
查看更多内容
影响因子:
1.3
作者:
D. Kozlov
通讯作者:
D. Kozlov
DOI:
--
发表时间:
1991
期刊:
Journal of Combinatorial Theory
影响因子:
--
作者:
G. Ziegler
通讯作者:
G. Ziegler
影响因子:
0.8
作者:
P. Csorba;József Osztényi
通讯作者:
József Osztényi
影响因子:
8.6
作者:
Huijse, Liza;Halverson, James;Schoutens, Kareljan
通讯作者:
Schoutens, Kareljan
影响因子:
0.8
作者:
Vadim E. Levit;Eugen Mandrescu
通讯作者:
Eugen Mandrescu