arXiv Analytics

Sign in

arXiv:math/0404503 [math.CO]AbstractReferencesReviewsResources

Edge distribution of graphs with few induced copies of a given graph

Vladimir Nikiforov

Published 2004-04-27Version 1

We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.

Comments: 22 pages, submitted to Comb. Prob. and Comp, author's name expanded
Categories: math.CO
Subjects: 05C75
Related articles: Most relevant | Search more
arXiv:1612.04603 [math.CO] (Published 2016-12-14)
Almost partitioning the hypercube into copies of a graph
arXiv:2101.09769 [math.CO] (Published 2021-01-24)
A Removal Lemma for Ordered Hypergraphs
arXiv:1704.08799 [math.CO] (Published 2017-04-28)
The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs

Links

Toolbox