Programme
You can download the programme here.
You will receive a print copy upon arrival.
| Wednesday 7th July 2010 | |
|---|---|
| 09.30 | Those with accommodation who would like to leave their luggage in storage until check-in is permitted (at 2pm) should meet outside the Maths building. |
| 10.00 | Tea and Coffee registration in the Maths building, room 102 |
| 11.00 | Invited Talk: Prof. Peter J Cameron (QMUL) Connectivity, random walks and optimal block designs |
| 12.00 | Break |
| 12.10 | Aylin Cakiroglu On the Optimality of the Generalized Hexagon |
| 12.35 | Federico Montecalvo Some Constructions of General Covering Designs |
| 13.00 | Lunch in room 102 |
| 14.00 | Hiu-Fai Law Independence Polynomial of a Tree |
| 14.25 | Li Tao Random Polynomials |
| 14.50 | Aiofe Hennessy Integer sequences, Orthogonal Polynomials and Riordan Arrays |
| 15.15 | Tea and Coffee in Room 102 (and maybe biscuits if you're lucky...) |
| 15.45 | Konrad Dabrowski Colouring Vertices of Triangle-Free Graphs |
| 16.10 | Nicholas Korpelainen Hamiltonian Cycles in Subcubic Graphs: What makes the Problem Difficult |
| 16.35 | Edward J. L. Bell. Strong-connectivity of Word Digraphs |
| Thursday 8th July 2010 | |
|---|---|
| 09.30 | John Faben On the Lovasz Vector of a Graph |
| 09.55 | Colin Mayhill Factorial Properties of Graphs |
| 10.20 | Tea and Coffee in Room 102 (with potential biscuits) |
| 11.00 | Invited Talk: Dr. Søren Riis (QMUL) A new Max-Flow Min-Cut Theorem |
| 12.00 | Break |
| 12.10 | Michael Brough Infinite Cores |
| 12.35 | Victor Falgas-Ravry Sharpness in k for the k-nearest neighbours model |
| 13.00 | Lunch in room 102 |
| 14.00 | Invited Talk: Dr. Deryk Osthus (University of Birmingham) Hamilton decompositions of graphs and digraphs |
| 15.00 | Tea and Coffee in Room 102 (plus whatever biscuits remain by this point. Probably just those God-awful plain ones.) |
| 15.30 | Niema Ali Aboluion DNA Codes with a reverse complement constraint |
| 15.55 | Penying Rochanakul Two-Level Fingerprinting Codes |
| 16.20 | Linzy A. Phillips Erasure-Correcting Codes Incorporating Puzzle-Type Constraints and Meta-Information |
| Friday 9th July 2010 | |
|---|---|
| 09.30 | Matthew White Long cycles in 2-coloured graphs |
| 09.55 | Lutz Warnke Dense subgraphs in the H-free process |
| 10.20 | Tea and Coffee in Room 102 (are there really likely to be any biscuits left by now? You might have to bring your own.) |
| 11.00 | Invited Talk Prof. Jan van den Heuvel (LSE) Degrees of Perfection |
| 12.00 | Break |
| 12.10 | Michael Adamaszek Square roots and higher roots of graphs |
| 12.35 | Jessica Enright Caterpillars, trees, and alligators: a chat about intersection graphs |
| 13.00 | Lunch in room 102 |