Title of article
A Kruskal–Katona type theorem for graphs
Author/Authors
Frohmader، نويسنده , , Andrew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
21
From page
17
To page
37
Abstract
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal–Katona theorem. A bound on non-consecutive clique numbers is also proven.
Keywords
f-vector , Face numbers , Kruskal–Katona , Clique complex
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2010
Journal title
Journal of Combinatorial Theory Series A
Record number
1531456
Link To Document