1 - 6 of 6
Feb
12
Discrete Mathematics Seminar
Yukai Tang, Princeton
A polynomial-time combinatorial algorithm for coloring perfect graphs
Feb
19
Discrete Mathematics Seminar
Michael Krivelevich, Tel Aviv University
Combinatorial conditions for graph rigidity, with applications to random graphs
Feb
26
Mar
05
Discrete Mathematics Seminar
Yuval Wigderson, ETH
Triangle-free graphs and the odd Hadwiger conjecture
Mar
19
Mar
26