A Kruskal-Katona Type Theorem for Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
23 pages

Keywords

Combinatorics, 05C69; 13F55; 05D99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/140485

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0710.3960
 http://arxiv.org/abs/0710.3960

Collections

arXiv