Combinatorics Seminar
Dhruv Mubayi
UIC
Counting Substructures
Abstract: For various (hyper)graphs F, we give sharp lower bounds on the
number of copies of F in a (hyper)graph with a prescribed number
of vertices and edges. Our results extend those of Rademacher,
Erdos and Lovasz-Simonovits for graphs and of Bollobas, Frankl,
Furedi, Keevash, Pikhurko, Simonovits and Sudakov for hypergraphs.
The proofs use the hypergraph removal lemma and stability results
for the corresponding Turan problem proved by the above authors.
Monday October 19, 2009 at 3:00 PM in SEO 427