University of Cambridge > > Trinity Mathematical Society > Compressions in Extremal Combinatorics

Compressions in Extremal Combinatorics

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mary Fortune.

Part of the TMS Symposium

How big can a family of finite sets satisfying some property be? One obstacle to answering this type of question is a lack of structure. Compressions are one way of imposing structure on families of sets. What are they, and what can we use them to find out?

This talk is part of the Trinity Mathematical Society series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity