Graphs with many copies of a given subgraph
Combinatorics
2007-11-26 v1
Abstract
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
Cite
@article{arxiv.0711.3493,
title = {Graphs with many copies of a given subgraph},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0711.3493},
year = {2007}
}