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.
|Number of pages||9|
|Publication status||Published - 2008 May|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics