Clique vectors of k-connected chordal graphs
From MaRDI portal
Publication:2258904
Abstract: The clique vector of a graph is the sequence in , where is the number of cliques in with vertices and is the largest cardinality of a clique in . In this note, we use tools from commutative algebra to characterize all possible clique vectors of -connected chordal graphs.
Recommendations
Cites work
- A Kruskal-Katona type theorem for graphs
- Face vectors of flag complexes
- scientific article; zbMATH DE number 16165 (Why is no real title available?)
- Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
- Monomial Ideals
- Shellable quasi-forests and their h-triangles
- Threshold graphs, shifted complexes, and graphical complexes
Cited in
(6)
This page was built for publication: Clique vectors of \(k\)-connected chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258904)