Abstract | ||
---|---|---|
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 is an element of 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. (C) 2021 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
---|---|---|
2021 | 10.1016/j.disc.2021.112470 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Induced subgraphs, Claw-free, Even-hole-free, Simplicial clique | Journal | 344 |
Issue | ISSN | Citations |
9 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Maria Chudnovsky | 1 | 390 | 46.13 |
Alex Scott | 2 | 251 | 40.93 |
Paul D. Seymour | 3 | 2786 | 314.49 |
Sophie Theresa Spirkl | 4 | 8 | 7.36 |