抄録
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.
| 元の言語 | English |
|---|---|
| ページ（範囲） | 315-323 |
| ページ数 | 9 |
| ジャーナル | Combinatorica |
| 巻 | 28 |
| 発行部数 | 3 |
| DOI | |
| 出版物ステータス | Published - 2008 5 1 |
| 外部発表 | Yes |
Fingerprint
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics
これを引用
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs. / Herzog, Jürgen; Murai, Satoshi; Zheng, Xinxian; Hibi, Takayuki; Trung, Ngô Viêt.
：: Combinatorica, 巻 28, 番号 3, 01.05.2008, p. 315-323.研究成果: Article
}
TY - JOUR
T1 - Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
AU - Herzog, Jürgen
AU - Murai, Satoshi
AU - Zheng, Xinxian
AU - Hibi, Takayuki
AU - Trung, Ngô Viêt
PY - 2008/5/1
Y1 - 2008/5/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=49649106220&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=49649106220&partnerID=8YFLogxK
U2 - 10.1007/s00493-008-2319-8
DO - 10.1007/s00493-008-2319-8
M3 - Article
AN - SCOPUS:49649106220
VL - 28
SP - 315
EP - 323
JO - Combinatorica
JF - Combinatorica
SN - 0209-9683
IS - 3
ER -