THIS SITE

Information for

Welcome to Combinatorics and Optimization

Spring 2018 Undergraduate Research Assistantship Program (URA)Applications for the Spring 2018 program are now closed.


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 is:

Sergey Norin - November 2

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


Grad Studies: Fall 2019 applications now open

 New Deadline: February 1, '19


  1. Jan. 16, 2019Sparse structures in graphs and matroids

    Professors Peter Nelson (PI) and Luke Postle (co-PI) have been awarded an International Research Partnership Grant (IPRG) for their project Sparse structures in graphs and matroids.

  2. Jan. 9, 2019Ronald C. Read (1924-2019)

    Former C&O faculty member Ronald (Ron) Read died on January 7, 2019 at the age of 94.

  3. Jan. 1, 2019Jane Gao joins the C&O department

    The C&O department is pleased to welcome our newest faculty member, Jane (Pu) Gao.

Read all news
  1. Jan. 22, 2019Reading Group - Graph Theory

    Title: Announcing new Reading Group this term on the topic of "Entropy and Counting"

    Speaker: Various/TBD
    Affiliation: University of Waterloo
    Room: MC 6486

    Abstract:

    A new Reading Group will be starting this term on the topic of "Entropy and Counting". The talks will take place weekly on Tuesdays from 2:00 p.m. to 3:00 p.m. in MC 6486 starting on Jan 22th.

  2. Jan. 22, 2019Reading Group on Entropy and Counting- Richard Lang

    Title: Introduction to Entropy and Counting

    Speaker:  Richard Lang
    Affiliation: University of Waterloo
    Room: MC 6486

    Abstract: In the first talk of our reading group, we introduce the notion of entropy and derive some of its basic properties.

  3. Jan. 23, 2019Graphs and Matroids Seminar- Bill Kay

    Title: Induced Poset Saturation

    Speaker: Bill Kay
    Affilliation: Ryerson University
    Room: MC 6486

    Abstract: In Graph Theory, we say that a graph G is H saturated if G contains no copy of H as a subgraph,

All upcoming events