Tom Rackham Combinatorics Group Mathematical Institute University of Oxford OX1 3LB, UK   Merton College OX1 4JD, UK Email:

Academic Information

• Interests:
  • My interests lie in all areas of graph theory and combinatorics, but
    particularly: extremal questions, graph colouring theory and applications
    of the probabilistic method. My DPhil research has centred on some
    aspects of extending graph colourings (phrased as an extremal problem)
    and the related computational considerations.
  
  
• Research:
  
  • [1] A Precolouring Extension of Brooks' Theorem (submitted)
  • [2] A note on -free precolouring with colours, Electronic J. Comb. (2009) 16(1) #N28
  • [3] The complexity of changing colourings with bounded maximum degree (submitted)
  • [4] The number of defective colourings of graphs on surfaces (in preparation)
  • [5] Adding vertices into a precoloured set (in preparation)


• Education Outline:

  10/07-09/08	Lecturer in Pure Mathematics, Merton College Oxford
  10/04-current	DPhil/PhD Student, Oxford University
  	(Academic year 2004-05 at University College London)
  09/00-06/04	BA and Certificate of Advanced Study in Mathematics, Cambridge University
  	[0] My Part III essay: Embedding Graphs in Surfaces