论文标题
超图和有限程度复合物的独立复合物
Independence complexes of hypergraphs and bounded degree complexes
论文作者
论文摘要
有界度的复杂$ bd（g，λ）$是图形匹配复合物的概括。在本文中，我们表明，通过使用超图的独立配合物，森林的有界程度复合物是可壳的。当图$ g $有叶子时，我们获得有限学位复合体的楔形分解结果
The bounded degree complex $BD(G,λ)$ is a generalization of the matching complexes of a graph. In this paper, we show that the bounded degree complex of a forest is shellable, by using independence complexes of hypergraphs. We obtain a wedge decomposition result of bounded degree complexes when a graph $G$ has a leaf
