# Welcome to Combinatorics and Optimization

Spring 2020 Undergraduate Research Assistantship Program (URA). ***ON-LINE APPICATIONS OPEN November 1, 2019.***

Tutte's Distinguished Lecture Series

The very successful Tutte's 100th Distinguished Lecture Series has now completed. That success has led to a Tutte Distinguished Lecture once per term. The next lecture will happen in the Spring term.

*Recordings of occurred talks are all available on C&O's YouTube Channel

Grad Studies: Fall 2020 applications now open

1. Dec. 23, 2019Outstanding Teaching Assistant Award

2. Nov. 14, 2019Faculty of Mathematics Research Chair

C&O Professor Levent Tuncel has been awarded a five-year Faculty of Mathematics Research Chair. The award recognizes Levent's exceptional scholarly achievements and pre-eminence in the field of optimization.

3. Nov. 7, 2019"Protocols for Authentication and Key Establishment" is published by Springer

The book, written by Colin Boyd, Anish Mathuria and C&O Professor Douglas Stebila, is the most comprehensive and integrated treatment of the protocols required for authentication and key establishment.

1. Jan. 23, 2020Algebraic Combinatorics Seminar - Karen Yeats

Title: Some places matroids appear in quantum field theory and some places I would like them to

 Speaker: Karen Yeats Affiliation: University of Waterloo Room: MC 5417

Abstract:

I will discuss some places matroids have appeared in my work in quantum field theory, including some older work on numerator structure with Dirk Kreimer and some work in progress with Iain Crump on period identities.

2. Jan. 23, 2020Graphs and Matroids Seminar - Jane Gao

Title: Uniformly generate graphs with given degrees rapidly

 Speaker: Jane Gao Affiliation: University of Waterloo Room: MC 5479

Abstract:

I will survey the research on exact/approximate uniform generation of graphs with prescribed degrees.

3. Jan. 24, 2020Combinatorial Optimization Reading Group - Ben Moore

Title: On the Strong Nine Dragon Tree Conjecture

 Speaker: Ben Moore Affiliation: University of Waterloo Room: MC 5417

Abstract:

Nash-Williams forest covering theorem says that a graph decomposes into $k$ forests if and only if it has fractional arboricity at most $k$. In 2012 Mickeal Montassier, Patrice Ossona de Mendez, Andre Raspaud, and Xuding Zhu  proposed a significant strengthening of Nash-Williams Theorem, called the Strong Nine Dragon Tree Conjecture.

All upcoming events