A Kruskal-Katona Type Theorem for Graphs

Details A Kruskal-Katona Type Theorem for Graphs A Kruskal-Katona Type Theorem for Graphs

2007-10-22

arxiv.org/abs/0710.3960v1

Mathematics

Combinatorics

23 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Kruskal-Katona Type Theorem for Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Kruskal-Katona Type Theorem for Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Kruskal-Katona Type Theorem for Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357592