- Series
- Combinatorics Seminar
- Time
- Friday, March 28, 2025 - 3:15pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Anita Liebenau – UNSW Sydney – A.Liebenau@unsw.edu.au – https://sites.google.com/site/aliebenau/home
- Organizer
- Tom Kelly
What is the smallest number of edges that a graph can have if it contains all $D$-degenerate graphs on $n$ vertices as subgraphs? A counting argument shows that this number is at least of order $n^{2−1/D}$, assuming n is large enough. We show that this is tight up to a polylogarithmic factor.
Joint work with Peter Allen and Julia Böttcher.