One-Day Colloquia in Combinatorics, in Honour of Norman Biggs |
A full schedule of times and locations of talks can be found here.
Abstracts of all the talks can be found, in PDF format, here.
Wednesday 16th May | ||
Queen Mary, University of London - start time 10.30 | ||
Speaker | Affiliation | Title |
Béla Bollobás | (University of Cambridge) | Problems, results and conjectures on the two-dimensional square lattice |
David Conlon | (University of Cambridge) | Some new results in Ramsey theory |
Jackie Daykin | (Royal Holloway, UoL) | String factorization algorithmics |
Tony Gardiner | (University of Birmingham) | Combinatorics for the common man |
Anthony Hilton | (Queen Mary, UoL) | Degree bounded factorizations of graphs |
Svante Janson | (University of Uppsala, Sweden) | Two sorting problems and the maximum number of runs in a randomly evolving sequence |
Colin McDiarmid | (University of Oxford) | Random graphs on surfaces |
Robin Wilson | (Open University) | Euler's science of combinatorics |
Douglas Woodall | (University of Nottingham) | Recent results on graph colourings |
Thursday 17th May - start time 10.00 | ||
London School of Economics and Political Science | ||
Chris Godsil | (University of Waterloo, Canada) | Quantum computing and algebraic graph theory |
Peter Rowlinson | (University of Stirling) | Star complements in regular graphs |
John Shawe-Taylor | (University College London) | Graph complexity for structure and learning |
Derek Smith | (University of Glamorgan) | From distance-transitive graphs to spectrum efficiency |
Dominic Welsh | (University of Oxford) | Counting problems in minor closed classes of graphs |
Norman Biggs | (London School of Economics) | Special presentation |
Last change: 10th May 2007