A Kruskal-Katona Type Theorem for Graphs
Combinatorics
2007-10-23 v1
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.
Cite
@article{arxiv.0710.3960,
title = {A Kruskal-Katona Type Theorem for Graphs},
author = {Andy Frohmader},
journal= {arXiv preprint arXiv:0710.3960},
year = {2007}
}
Comments
23 pages