This Friday, 4 May, starting at 2pm, the Centre is running a miniconference (jointly with the Combinatorics Study Group) entitled “UCLA@QMUL”. Benny Sudakov and two of his students will speak.
The programme (talks are in M103, Mathematical Sciences building):
- 14:00-15:00: Choongbum Lee (UCLA), Robustness of graphs – case study: Dirac’s theorem
- 15:00-16:00: Hao Huang (UCLA), Extremal problems in Eulerian digraphs
- 16:00-16:30: tea
- 16:30-17:30: Benny Sudakov (UCLA), The phase transition in random graphs – a simple proof
- 17:30-18:30: refreshments in Mathematics building foyer