Graphs with many copies of a given subgraph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n.

Keywords

Combinatorics, 05C35

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv