Past Events
Apr
10
Discrete Mathematics Seminar
Scott Baldridge, Louisiana State
State-reducibility and a new gauge-theoretic approach to the four color theorem
Apr
03
Discrete Mathematics Seminar
Robert Simon, London School of Economics
Proper graph colouring, optimization, and paradoxical decompositions
Mar
27
Discrete Mathematics Seminar
Daniel McGinnis, Princeton
A necessary and sufficient condition for k-transversals
Mar
20
Discrete Mathematics Seminar
Nicolas Trotignon , ENS Lyon
Every graph is essential to large treewidth
Mar
06
Discrete Mathematics Seminar
Lior Gishboliner, University of Toronto
New results on the complexity of edge-modification problems
Feb
27
Discrete Mathematics Seminar
Richard Montgomery, University of Warwick
Large transversals in equi-n-squares
Feb
20
Feb
06
Dec
05
Nov
21
Discrete Mathematics Seminar
Stefan Glock, University of Passau
Discrepancy of spanning substructures in hypergraphs
Nov
14
Discrete Mathematics Seminar
Leo Veerstegen, LSE
Embedding trees in graphs with large minimum degree
Nov
07
Discrete Mathematics Seminar
Igor Balla, Masaryk University
MaxCut, orthonormal representations, and extension complexity of polytopes
Oct
31
Discrete Mathematics Seminar
Vijay V. Vazirani , University of California, Irvine
A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length
Oct
24
Oct
10
Oct
08
Discrete Mathematics Seminar
Special Lecture
Eli Berger, University of Haifa
Coloring the intersection of two matroids
Oct
08
Discrete Mathematics Seminar
Special Lecture
Eli Berger, University of Haifa
Coloring the intersection of two matroids
Sep
26
Discrete Mathematics Seminar
Martin Milanic, University of Primorska
Tree decompositions meet induced matchings
Sep
19
Discrete Mathematics Seminar
Sahar Diskin, Tel Aviv U
Component sizes in percolation on finite regular graphs
Sep
16
Discrete Mathematics Seminar
Special Lecture
Alex Cohen, MIT
Incidence lower bounds and applications
Sep
16
Discrete Mathematics Seminar
Special Lecture
Alex Cohen, MIT
Incidence lower bounds and applications
Sep
12
Discrete Mathematics Seminar
Stoyan Dimitrov, Rutgers
BFS versus DFS for random targets in ordered trees
Sep
05