A note on simplicial cliques
| dc.contributor.author | Chudnovsky, Maria | |
| dc.contributor.author | Scott, Alex | |
| dc.contributor.author | Seymour, Paul | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2022-08-12 00:40:33 (GMT) | |
| dc.date.available | 2022-08-12 00:40:33 (GMT) | |
| dc.date.issued | 2021-09 | |
| dc.identifier.uri | https://doi.org/10.1016/j.disc.2021.112470 | |
| dc.identifier.uri | http://hdl.handle.net/10012/18522 | |
| dc.description | The final publication is available at Elsevier via https://doi.org/10.1016/j.disc.2021.112470. © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| dc.description.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 ε 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. | en |
| dc.description.sponsorship | Supported by NSF grant DMS-1763817. Supported by AFOSR grant A9550-19-1-0187 and NSF grant DMS-1800053. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC), [funding reference number RGPIN-2020-03912]. Cette recherche a été financée par le Conseil de recherches en sciences naturelles et en génie du Canada (CRSNG), [numéro de référence RGPIN-2020-03912]. | en |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | induced subgraphs | en |
| dc.subject | claw-free | en |
| dc.subject | even-hole-free | en |
| dc.subject | simplicial clique | en |
| dc.title | A note on simplicial cliques | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Chudnovsky, M., Scott, A., Seymour, P., & Spirkl, S. (2021). A note on simplicial cliques. Discrete Mathematics, 344(9), 112470. https://doi.org/10.1016/j.disc.2021.112470 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International