Complexes of graphs with bounded independence number

被引：0
|
作者：
Minki Kim
Alan Lew
机构：
[1] Gwangju Institute of Science and Technology,Division of Liberal Arts and Sciences
[2] Technion-Israel institute of Technology,Department of Mathematics
来源：
Israel Journal of Mathematics | 2022年 / 249卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let G = (V, E) be a graph and n a positive integer. Let In(G) be the abstract simplicial complex whose simplices are the subsets of V that do not contain an independent set of size n in G. We study the collapsibility numbers of the complexes In(G) for various classes of graphs, focusing on the class of graphs with maximum degree bounded by Δ. As an application, we obtain the following result
引用
收藏
页码：83 / 120
页数：37
相关论文
共 50 条
12345