Kruskal--Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
classification
🧮 math.CO
keywords
chordalcliquecomplexforestsgraphkruskal--katonapurequasi-forest
read the original abstract
A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal--Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. In addition, it will be shown that a quasi-forest is shellable if and only if its $h$-vector $(h_0, h_1, h_2, ...)$ satisfies $h_i = 0$ for $i > 1$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.