Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs

被引：9

作者：

Herzog, Juergen ^{[1
]}

Hibi, Takayuki ^{[2
]}

Murai, Satoshi ^{[2
]}

Trung, Ngo Viet ^{[3
]}

Zheng, Xinxian ^{[1
]}

机构：

[1] Univ Duisburg Essen, Fachbereich Math & Informat, D-45117 Essen, Germany

[2] Osaka Univ, Grad Sch Informat Sci & Technol, Dept Pure & Appl Math, Osaka 5600043, Japan

[3] Inst Math, Hanoi 10307, Vietnam

来源：

COMBINATORICA | 2008年 / 28卷 / 03期

关键词：

D O I：

10.1007/s00493-008-2319-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：315 / 323

页数：9

共 6 条

[1] Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
Jürgen Herzog
Satoshi Murai
Xinxian Zheng
Takayuki Hibi
Ngô Viêt Trung
Combinatorica, 2008, 28 : 315 - 323
[2] A Kruskal-Katona type theorem for graphs
Frohmader, Andrew
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2010, 117 (01) : 17 - 37
[3] Stability theorems for some Kruskal-Katona type results
Liu, Xizhi
Mukherjee, Sayan
EUROPEAN JOURNAL OF COMBINATORICS, 2023, 110
[4] Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
Nevries, Ragnar
Rosenke, Christian
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 382 - 393
[5] Strong clique trees, neighborhood trees, and strongly chordal graphs
McKee, TA
JOURNAL OF GRAPH THEORY, 2000, 33 (03) : 151 - 160
[6] Characterizing and computing the structure of clique intersections in strongly chordal graphs
Nevries, Ragnar
Rosenke, Christian
DISCRETE APPLIED MATHEMATICS, 2015, 181 : 221 - 234

← 1 →