Peter Danziger (Ryerson University)
The Generalised Oberwolfach Problem: The Bipartite Case

We will discuss various types and variations of 2-factorizations of the complete graph. Factorization into triples was introduced by Kirkman in 1848, though the so called Kirkman problem was only solved in 1971 by Ray-Chadhuri and Wilson. In the 1960's Ringel introduced the so called Oberwolfach problem, which remains open, though many special cases are know known. Subsequently a number of variations on this problem have been suggested, including an extension to the even case. We will discuss some general types of 2-factorization and give some results on these, with particular focus on the case when the 2-factors are bipartite.