Seminar

Thursday, October 25, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar- Nathan Lindzey

Title: Maximum Independent Sets in Erdos-Ko-Rado Combinatorics

Speaker: Nathan Lindzey
Affiliation: University of Waterloo
Room: MC 6486

Abstract:  We discuss a general algebraic method for characterizing maximum independent sets in graphs that arise in Erdos-Ko-Rado combinatorics, provided the graphs are large enough. 

Thursday, October 18, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar- Chris Godsil

Title: Graphs of Homomorphisms

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 6486

Abstract: If X and Y are graphs and f is a function on V (X) taking values in V (Y ), then the graph of
f is the subset formed by the pairs (x; f(x)) for x in V (X).

Thursday, October 18, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids Seminar

Title: Extending Thomassen’s Theorem to Two Faces

Speaker: Joshua Nevin
Affiliation: University of Waterloo
Room:  MC 5417

Abstract:

Let G be a planar graph and let L be a list-assignment for G in which there is a precolored edge on the outer face, every other vertex on the outer face has a list of size at least 3, and every other vertex in G has a list of size at least 5.

Friday, November 2, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Distinguished Lecture - Sergey Norin

Title: Razborov's flag algebras: Ten years on

Speaker: Sergey Norin
Affiliation: McGill University
Room: MC 5501

Abstract:

Many of the classical results in extremal combinatorics were obtained by ingenious application of elementary techniques, such as induction and Cauchy-Schwarz inequality.

Friday, October 19, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization

Title: Primal-dual and Lagrangian relaxation techniques for k-median

Speaker: Madison Van Dyk
Affiliation: University of Waterloo
Room:  MC 5479

Abstract: We will develop primal-dual algorithms to obtain constant-factor approximations for the uncapacitated facility location problem.

Friday, October 19, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Matthias Mnich

Title: New algorithms for maximum disjoint paths based on tree-likeness

Speaker: Matthias Mnich
Affiliation: University of Bonn
Room: MC 5501

Abstract:

We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph.

Friday, October 12, 2018 10:30 am - 10:30 am EDT (GMT -04:00)

Special Seminar - Gareth Davies

Title: Offline Assisted Group Key Exchange

Speaker: Gareth Davies
Affiliation: Norwegian University of Science and Technology (NTNU)
Room: MC 5417

Abstract:

This talk will focus on the problem of forward secrecy in group key exchange (GKE), where most of the participants remain offline until they wish to compute the key.