on Fridays starting at 10:15 a.m. Coffee available from 10.
Fri Dec 7
Petteri Kaski
Enumeration of the 1-factorizations of the complete graph K_{14}
Abstract:
In how many different ways can one organize a round-robin football tournament for 14 teams? Two answers conditioned on the precise definition of ``different'' are 98758655816833727741338583040 and 1132835421602062347. This talk provides some background on the problem and discusses the combinatorial algorithms used to compute these numbers.
This is joint work with Patric Östergård.
Last updated on 17 Dec 2007 by Martti Mäntylä - Page created on 7 Dec 2007 by Teija Kujala