Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs (Q949799): Difference between revisions
From MaRDI portal
Latest revision as of 18:47, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs |
scientific article |
Statements
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs (English)
0 references
21 October 2008
0 references
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.
0 references
Kruskal-Katona theorem
0 references
simplicial complexes
0 references
clique complex
0 references
\(f\)-vectors
0 references
chordal graph
0 references
0 references
0 references
