Past Events

2013-2014

Jul 21

Stefan van Zwam, Princeton University

2014 International Workshop on Structure in Graphs and Matroids
Lewis Library 120 / -
May 01

Jacob Fox , MIT

The Green-Tao Theorem and a Relative Szemerédi Theorem
Fine Hall 224 / -
Apr 24

Yuval Filmus , IAS

The structure of almost linear Boolean functions
Fine Hall 224 / -
Apr 10

Peter Keevash , Oxford University

The existence of designs
Fine Hall 224 / -
Mar 27

Jop Briët , NYU

Locally decodable codes and geometry of tensor norms
Fine Hall 224 / -
Mar 13

Wesley Pegden , Carnegie Mellon University

Between 2- and 3-colorability
Fine Hall 224 / -
Mar 06

June Huh, University of Michigan

The tropical Laplacian
Fine Hall 224 / -
Feb 27

David Moulton , CCR, Princeton University

Maximal non-Hamiltonian graphs
Fine Hall 224 / -
Feb 20

Esther Ezra , NYU

Geometric Discrepancy Via the Entropy Method
Fine Hall 224 / -
Feb 13

Alex Scott , Oxford University

Hypergraphs of bounded disjointness
Fine Hall 224 / -
Feb 06

Julia Chuzhoy , TTI Chicago

Polynomial bounds for the grid-minor theorem
Fine Hall 224 / -
Dec 12

Adam Sheffer , Tel-Aviv University

Recent progress in distinct distances problems
Fine Hall 224 / -
Dec 05

Noga Alon, Tel-Aviv University

Sum-free subgroups
Fine Hall 224 / -
Nov 21

Rani Hod, Georgia Tech

Component games on regular graphs
Fine Hall 224 / -
Nov 14

Dillon Mayhew, Victoria University of Wellington

Fragile matroids and excluded minors
Fine Hall 224 / -
Nov 07

Krystal Guo , Simon Fraser University

Simple eigenvalues of vertex-transitive graphs
Fine Hall 224 / -
Oct 24

Natan Rubin , Jussieu Institute of Mathematics/Paris 6

On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
Fine Hall 224 / -
Oct 17

Alan Sokal , NYU

Some wonderful conjectures (but very few theorems) at the boundary between analysis, combinatorics and probability
Fine Hall 224 / -
Oct 10

Jeff Kahn, Rutgers University

Turan's theorem for random graphs
Fine Hall 224 / -
Sep 19

Maria Chudnovsky, Columbia University

Three-coloring graphs with no induced 6-edge paths
Fine Hall 224 / -
Sep 12

Matthieu Plumettaz , Columbia University

The structure of graphs with no cycles of length divisible by three
Fine Hall 224 / -