Title: Using Lasserre Hierarchy for Graph ColoringSpeaker: Julian Romero Barbosa Affiliation: University of Waterloo Room: MC 5479
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).
Title: Toward a Theory of Crossing-Critical GraphsSpeaker: Bojan Mohar Affiliation: Simon Fraser University Room: MC 5501
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.