Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, March 22, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Stephen J. Wright

Title: Optimization in Data Analysis: Some Recent Developments

Speaker: Stephen J. Wright
Affiliation:

Computer Sciences Department and Wisconsin Institute for Discovery 

University of Wisconsin-Madison

Room: MC 5501

Abstract:

Optimization is vital to the modern revolution in data science, and techniques from optimization have become essential in formulating and solving a wide variety of data analysis problems. In turn, data science has caused a ferment of new research activity in optimization by posing challenging new problems and new contexts.

Tuesday, March 26, 2019 2:00 pm - 2:00 pm EDT (GMT -04:00)

Reading Group on Entropy and Counting - John Schanck

Title: On the average size of independent sets in triangle-free graphs

Speaker: John Schanck
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Some of the results that we've seen in this reading group have been improved recently using the "hard-core model" from statistical physics.

Wednesday, March 27, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids Seminar - Rose McCarty

Title: Decomposing graphs into rooted odd trails

Speaker: Rose McCarty
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

We give a precise characterization of when the edge set of a graph can be partitioned into k trails so that every trail begins and ends at a specified vertex v and has an odd number of edges.

Joint work with Jim Geelen and Paul Wollan.

Friday, March 29, 2019 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization Seminar - Julian Romero Barbosa

Title: Using Lasserre Hierarchy for Graph Coloring  

Speaker: Julian Romero Barbosa
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

In this talk, I will go over a technique introduced by Arora and Ge for coloring 3-colorable graphs having low threshold rank (i.e., graphs with few eigenvalues below certain negative constant).

Friday, March 29, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Distinguished Lecture - Bojan Mohar

Image of Professor Bojan Mohar

Title: Toward a Theory of Crossing-Critical Graphs

Speaker: Bojan Mohar
Affiliation: Simon Fraser University
Room: MC 5501

Abstract: 

The crossing number of a graph is defined as the minimum number of crossings of edges in a drawing of the graph in the plane. In his seminal 1970 paper Toward a Theory of Crossing Numbers, Tutte made a fundamental contribution by proving what is known today as the Hanani-Tutte Theorem.

Wednesday, April 3, 2019 4:30 pm - 4:30 pm EDT (GMT -04:00)

PMath/C&O Joint Colloquium - Ben Moore

Title: A proof of the Hell-Nešetřil Dichotomy via Siggers Polymorphisms

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

Abstract:

In 2017, the constraint satisfaction dichotomy was proven via techniques from universal algebra. If we restrict this theorem to graphs, we get the Hell-Nešetřil Dichotomy, which is a statement about colouring graphs.