论文标题
占优势复合物和顶点覆盖图
Dominance complexes and vertex cover numbers of graphs
论文作者
论文摘要
简单图的优势复合物$ d（g）$ $ g =（v，e）$是由$ v $的子集组成的简单络合物，其补充是主导的。我们表明，$ d（g）$加$ 2 $的连接性是$ g $的顶点盖号$τ（g）$的下限。
The dominance complex $D(G)$ of a simple graph $G = (V,E)$ is the simplicial complex consisting of the subsets of $V$ whose complements are dominating. We show that the connectivity of $D(G)$ plus $2$ is a lower bound for the vertex cover number $τ(G)$ of $G$.
