A note on simplicial cliques

DOI10.1016/J.DISC.2021.112470zbMATH Open1467.05185arXiv2012.05287OpenAlexW3172965282MaRDI QIDQ2037547FDOQ2037547

Authors: Maria Chudnovsky, Sophie Spirkl, Alex Scott, Paul Seymour 

Publication date: 8 July 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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 $vinK$, 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.

Full work available at URL: https://arxiv.org/abs/2012.05287

Recommendations

• scientific article; zbMATH DE number 19181
• Note on the structure of graphs with bounded clique number
• On cliques in graphs
• A note on \(r\)-dominating cliques
• Cliques in \(k\)-connected graphs
• scientific article; zbMATH DE number 798640
• A note on cliques and independent sets
• Cliques in Steiner systems
• scientific article; zbMATH DE number 2096431
• scientific article; zbMATH DE number 1944140

zbMATH Keywords

claw-free graphinduced subgraphseven-hole-free graphsimplicial clique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Cites Work

• On rigid circuit graphs
• Two soluble models of an antiferromagnetic chain
• Growing without cloning
• Free fermions behind the disguise
• Free fermions in disguise

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Free fermions behind the disguise

This page was built for publication: A note on simplicial cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037547)