University of Cambridge > Talks.cam > Trinity Mathematical Society > Compressions in Extremal Combinatorics

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Compressions in Extremal Combinatorics

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room 2S8, Donald McIntyre Building, Faculty of Education, 184 Hills Road, Cambridge Average on Sundays: 7438.14189189 kWh Meeting Rooms 1&2, MRC Epidemiology Unit, Level 3, Institute of Metabolic Science, Cambridge Biomedical Campus, Cambridge CB2 0QQ

Other talks

Differences between Robin and Neumann eigenvalues Title to be confirmed Title to be confirmed Morning Tea and Coffee Quantifying the unquantifiable? Assessing the importance of almsgiving in early modern France and Spain Fairy Tales
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity