Edge distribution of graphs with few induced copies of a given graph
Combinatorics
2007-05-23 v1
Abstract
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
Cite
@article{arxiv.math/0404503,
title = {Edge distribution of graphs with few induced copies of a given graph},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0404503},
year = {2007}
}
Comments
22 pages, submitted to Comb. Prob. and Comp, author's name expanded