McGill University - School of Computer Science

Algorithms Seminar 2002

Everybody is welcome!

DATE: Wednesday, January 23rd
TIME: 16:30 PM - 17:30 PM
PLACE: McConnell 320
TITLE: Short Proofs of Classical Theorems
SPEAKER: Adrian Bondy, Departement de Mathematiques, Universite Lyon I

We give proofs of Dirac's and Ore's theorems on Hamilton circuits, Brooks' theorem on vertex colouring and Vizing's theorem on edge colouring, as well as the Chvatal-Lovasz theorem on semi-kernels and a theorem of Lu on spanning arborescences of tournaments. These proofs, while not radically different from existing ones, are perhaps simpler and more natural.

Direct questions, comments, additions to and removals from the mailing list, and suggestions for speakers to us at Algorithms Seminar organization. 
Web Address: