### Maximising copies of H in K_{r+1}-free graphs

- Series
- Combinatorics Seminar
- Time
- Friday, September 29, 2023 - 15:15 for 1 hour (actually 50 minutes)
- Location
- Skiles 308
- Speaker
- Natasha Morrison – University of Victoria – nmorrison@uvic.ca

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.