Schedule and titles of talks
Abstracts of the talks can be found, in PDF format here
Wednesday 20th May | ||
Queen Mary, University of London - start time 10.40 | ||
Talks
will be held in the Maths Lecture Theatre (MLT). This is
in the School of Mathematical Sciences, to which directions can be
found here: http://www.maths.qmul.ac.uk/about/location.shtml Coffee will be available from 10.00 in Room 102 for early arrivals. | ||
Time | ||
10.40 - 11.20 | Christian Elsholtz - Problems in multidimensional additive combinatorics | |
11.25 - 12.05 |
Alex Scott - Triangles in random graphs | |
12.05 - 13.30 |
Lunch (own arrangements - options
on campus and nearby) |
|
13.30
- 14.10 |
David Ellis - Combinatorial problems on the symmetric group: some applications of non-Abelian Fourier Analysis | |
14.15 - 14.55 |
Rob Morris - Some recent developments in bootstrap percolation | |
14.55
- 15.35 |
Tea break - Room 102 |
|
15.35
- 16.15 |
Luke Kelly
- Arbitrary
orientations of cycles in oriented graphs |
|
16.20
- 17.00 |
Mark Walters - Hamilton cycles in random geometric graphs | |
|
||
Thursday 21st May | ||
London School of Economics and Political Science - start time 10.00 | ||
Talks will be held in the New Theatre (E171), in the East
Building. Directions and maps can be found here:
http://www.lse.ac.uk/resources/mapsAndDirections/Default.htm The entrance to the East Building is on Houghton Street. |
||
Time |
||
10.00 - 10.45 |
Peter Keevash - The early evolution of the H-free process | |
10.45
- 11.05 |
Coffee break |
|
11.05 - 11.50 |
Stephanie Gerke - Random intersection graphs | |
11.55 - 12.40 |
Angelika Steger - Synchrony and asynchrony in neural networks | |
12.40 - 14.05 |
Lunch (own arrangements - options
on campus and nearby) |
|
14.05 - 14.50 |
Leslie Goldberg - A complexity dichotomy for hypergraph partition functions | |
14.50 - 15.10 | Coffee break |
|
15.10 -
15.55 |
Rahul Savani - Wiretapping: the nucleolus of connectivity | |
16.00
- 17.00 |
"The Norman Biggs Lecture" Jaroslav Nešetřil - On the category of graphs |
Last change: 13th May 2009 - SJ