MATH Seminar
| Title: Counting Substructures |
|---|
| Seminar: Combinatorics |
| Speaker: Dhruv Mubayi of The University of Illinois, Chicago |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2009-09-04 at 4:00PM |
| Venue: W306 |
| Download Flyer |
| 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. |
See All Seminars