|
Jan 22
|
Oliver Cooley (Birmingham)
|
Perfect matchings in hypergraphs
|
|
Jan 29
|
Luke Kelly (Birmingham)
|
Orientations of Hamilton cycles in directed graphs
|
|
Feb 5
|
Demetres Christofides (Birmingham)
|
Randomized algorithms for the majority problem
|
|
Feb 11 (Wednesday), 4pm, LRA
|
Deryk Osthus (Birmingham)
|
Hamilton cycles in graphs (Pure Maths Colloquium)
|
|
Feb 12
|
no seminar
|
|
|
Feb 19
|
Richard Mycroft (Birmingham)
|
Embedding trees into graphs
|
|
Feb 26
|
Stefanie Gerke (Royal Holloway)
|
Random intersection graphs
|
|
March 5
|
Robert Johnson (Queen Mary)
|
Vertex Turan problems in the hypercube
|
|
March 11 (Wednesday), 4pm, LRA
|
Imre Leader (Cambridge)
|
Pursuit and Evasion (Pure Maths Colloquium)
|
|
March 12
|
Peter Allen (Warwick)
|
Minimum degree conditions for large subgraphs
|