A Kruskal-Katona type theorem for graphs

作者：Frohmader Andrew^*

来源：Journal of Combinatorial Theory - Series A, 2010, 117(1): 17-37.

DOI：10.1016/j.jcta.2009.04.003

• Clique complex
• f-Vector
• Face numbers
• Kruskal-Katona

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 nonconsecutive clique numbers is also proven.

• 出版日期2010-1