Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs (Q949799): Difference between revisions

Simplicial complexes with a special ordering on their facets are called forests and quasi-forests due to their resemblance to graph theoretical forests. It is known that a forest is always a clique complex of a strongly chordal graphs, while a quasi-forest is always a clique complex of a chordal graph. This paper proves Kruskal-Katona type results on forests and quasi-forests.