Discrete Mathematics and Optimization Seminar

This seminar is jointly organized by the Department of Mathematics and Statistics and the School of Computer Science.

If you wish to be added to the seminar email list please subscribe here.

For other information contact seminar coordinator Sean Kennedy.

Map to Burnside Hall.
Map to McConnell (MC).
Current Seminar Schedule - Winter 2011
4:00PM in Burnside 1205 unless specified.
Jan. 10th, 2011

Domino shuffling for the Half-Hexagon graph (abstract)
Ben Young
Mathematical Sciences Research Institute
Jan. 13th, 2011
Burnside 920, 4:00 PM

Coloring via Vapnik-Cervonenkis Dimension (abstract)
Stephan Thomasse
Jan. 17th, 2011

Graph colouring via the probabilistic method (abstract)
Bruce Reed
Jan. 31st, 2011

A Randomized Rounding Approach to the Traveling Salesman Problem (abstract)
Mohit Singh
Feb. 7th, 2011

The semidefinite method in extremal graph theory (abstract)
Sergey Norin
Feb. 10th, 2011
Burnside 920, 4:00PM

Stability Method in Extremal Combinatorics (abstract)
Oleg Pikhurko
Carnegie Mellon University
Mar. 14th, 2011

Longest Cycles in Graphs with Given Independence Number and Connectivity (abstract)
Hehui Wu
University of Illinois
Mar. 28th, 2011

On the coalescence time of reversible random walks (abstract)
Roberto Imbuzeiro Oliveira
Apr. 11th, 2011
2PM Burnside 1214

A structure theorem for Boolean functions with small total influences (abstract)
Hamed Hatami
McGill University
Previous Schedules