---------------------------
Wednesday 2 February 2011
The Open University, Milton Keynes, UK.
---------------------------
Talks will take place in Room 15, Christodoulou Meeting Rooms at
Walton Hall Campus.
Refreshments will be served in the Mathematics and Statistics Common
Room, Alan Turing Building.
All are welcome -- no registration is necessary.
For further details and abstracts, see http://wcm.open.ac.uk
---------------------------
Schedule:
10:15-10:45 Tea/coffee
10:50-10:55 Introduction - Robin Wilson
11:00-11:40 Sophie Huczynska (University of St Andrews)
From sum-free sets to subgroups: what lies between?
11:45-12:25 Mark Jerrum (Queen Mary, University of London)
The computational complexity of Ising model on some
classes of matroids
12:30-13:55 Lunch
14:00-14:40 Deryk Osthus (University of Birmingham)
Perfect matchings and Hamilton cycles in hypergraphs
14:45-15:25 Tom McCourt (University of Queensland, moving to
University of Bristol)
Biembedding twofold triple systems
15:30-15:55 Tea/coffee
16:00-16:40 Colin McDiarmid (University of Oxford)
Colouring random geometric graphs
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
