2007/10/22 by Frohmader, Andy
#05C69 #05D99 #13F55 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.0710.3960
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.