MATH Seminar
| Title: Maximising copies of H in clique-free graphs |
|---|
| Seminar: Combinatorics |
| Speaker: Natasha Morrison of University of Victoria |
| Contact: Liana Yepremyan, liana.yepremyan@emory.edu |
| Date: 2023-09-27 at 4:00PM |
| Venue: MSC E406 |
| Download Flyer |
| Abstract: Let H be a graph. We show that if r is large enough as a function of H, then the r-partite Turán graph maximizes the number of copies of H among all Kr+1-free graphs on a given number of vertices. This confirms a conjecture of Gerbner and Palmer. This is joint work with JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek. |
See All Seminars