Kruskal--Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
Juergen Herzog, Takayuki Hibi, Satoshi Murai, Ngo Viet Trung, Xinxian Zheng
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. In addition, it will be shown that a quasi-forest is shellable if and only if its h-vector (h0, h1, h2, ...) satisfies hi = 0 for i > 1.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.