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.
Original language | English |
---|---|
Pages (from-to) | 315-323 |
Number of pages | 9 |
Journal | Combinatorica |
Volume | 28 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2008 May |
Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics