University of Cambridge > Talks.cam > Combinatorics Seminar > Symmetric Intersecting Families of Sets

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Symmetric Intersecting Families of Sets

Download to your calendar using vCal

  • UserDavid Ellis (QMUL)
  • ClockThursday 20 October 2016, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

Let X be a finite set. We say a family F of subsets of X is ‘three-wise intersecting’ if any three sets in F have nonempty intersection; we say it is ‘symmetric’ if it has transitive automorphism group. Frankl conjectured in 1981 that if F is a symmetric, three-wise intersecting family of subsets of an n-element set, then F has size o(2^n). We will discuss a recent (and surprisingly short) proof of this conjecture. Joint work with Bhargav Narayanan (Cambridge).

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 8973.92092457 kWh Lightfoot Room, Divinity School, Cambridge LonDELETED

Other talks

A Few Days in Patagonia - the Deep South CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body LMB Seminar - Mechanisms of mRNA packaging and export Seminars in Cancer Toward affordable preventive healthcare Secrets of the Surface: The Mathematical Vision of Maryam Mirzakhani ( EDI Film Screening)
 

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