| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656077 | Journal of Combinatorial Theory, Series A | 2010 | 21 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
