2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/140485A 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.23 pagesCombinatorics05C69; 13F55; 05D99text