A Kruskal-Katona Type Theorem for Graphs

Simple item page
dc.creatorFrohmader, Andy
dc.date2007-10-22
dc.date.accessioned2026-07-07T08:37:41Z
dc.date.available2026-07-07T08:37:41Z
dc.descriptionA 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.
dc.description23 pages
dc.identifierhttps://arxiv.org/abs/0710.3960
dc.identifierhttp://arxiv.org/abs/0710.3960
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140485
dc.subjectCombinatorics
dc.subject05C69; 13F55; 05D99
dc.titleA Kruskal-Katona Type Theorem for Graphs
dc.typetext

Files

Collections

arXiv