论文标题
简单集团的注释
A note on simplicial cliques
论文作者
论文摘要
受到凝结物理物理和量子信息理论的应用的启发，我们证明，每个非无孔均无孔的无爪图都有一个简单的集团，也就是说，一个集团$ k $，因此对于k $ in k $ in k $ in k $ in k $ in k $ in k $ y of $ k $ in k $ in k $ in k $ in k $ in of $ k $ s的集合。实际上，我们证明了由禁止诱导的子图定义的更一般的图表中的简单集团的存在。
Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, that is, a clique $K$ such that for every vertex $v \in K$, the set of neighbours of $v$ outside of $K$ is a clique. In fact, we prove the existence of a simplicial clique in a more general class of graphs defined by forbidden induced subgraphs.
