skip to content
 

Party hard! The maths of connections

Presented by: 
C Roney-Dougal
Date: 
Saturday 23rd March 2013 - 11:00 to 12:00
Venue: 
INI Seminar Room 1
Abstract: 
How many guests need to come to a party, to guarantee that at least five of them either all know each other or are mutual strangers? Join Dr Colva Roney-Dougal see some unexpected applications of the maths behind this still-unsolved problem, from modelling flu epidemics to galaxy formation.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons