A constant lower bound for the union-closed sets conjecture

print

Speaker: 

Dr. Justin Gilmer

Affiliation: 

Google Brain

Time: 

Tuesday, 24 January 2023, 09:30 to 10:30

Venue: 

  • via Zoom in A201

Organisers: 

Ramprasad Saptharishi

I will introduce Frankl's. conjecture, discuss prior approaches and why it is a bit notorious. Then will discuss an information-theoretic approach that establishes a constant lower bound for the maximum element frequency in union-closed families of sets.