Counting substructures III: quadruple systems
Combinatorics
2009-06-01 v1
Abstract
For various quadruple systems F, we give asymptotically sharp lower bounds on the number of copies of F in a quadruple system with a prescribed number of vertices and edges. Our results extend those of Furedi, Keevash, Pikhurko, Simonovits and Sudakov who proved under the same conditions that there is one copy of . Our proofs use the hypergraph removal Lemma and stability results for the corresponding Turan problem proved by the above authors.
Keywords
Cite
@article{arxiv.0905.4735,
title = {Counting substructures III: quadruple systems},
author = {Dhruv Mubayi},
journal= {arXiv preprint arXiv:0905.4735},
year = {2009}
}