Past Events

2010-2011

Apr 28

Alexandra Fradkin, Princeton University

Tournament pathwidth and topological containment
Fine Hall 224 / -
Apr 21

Paul Wollan, Sapienza University of Rome and Georgia Tech

New Proofs in Graph Minors
Fine Hall 224 / -
Apr 14

Robert DeMarco, Rutgers University

Upper tails for cliques
Fine Hall 224 / -
Apr 07

John Conway, Princeton University

The group number function: the number of groups of a given order
Fine Hall 224 / -
Mar 30

Maria Chudnovsky, Columbia University

Tournament heroes
Fine Hall 314 / -
Mar 10

Shachar Lovett, IAS

Linear systems modulo composites
Fine Hall 224 / -
Mar 03

Zeev Dvir, Princeton University

Rank bounds for design matrices with applications
Fine Hall 224 / -
Feb 24

Robin Thomas, Georgia Institute of Technology

Color 6-critical graphs on surfaces
Fine Hall 224 / -
Feb 17

Gabor Kun, Rutgers University

Cops and robbers in random graphs
Fine Hall 224 / -
Feb 10

Will Perkins, New York University

Phase Transitions of Achlioptas Processes
Fine Hall 224 / -
Dec 16

Menachem Kojman, Ben Gurion University and IAS

Choice numbers and coloring numbers - the infinite case
Fine Hall 224 / -
Dec 14

Harvey Friedman, Columbia University

Concrete mathematical incompleteness
Fine Hall 224 / -
Dec 09

Andrew King, Columbia University

Proving the Lovász-Plummer conjecture
Fine Hall 224 / -
Dec 02

Shachar Lovett, Tel-Aviv University and IAS

Higher-order Fourier analysis of $F_p^n$ and the complexity of systems of linear forms
Fine Hall 224 / -
Nov 18

Noga Alon, Tel-Aviv University and IAS

Hypergraph list coloring and Euclidean Ramsey Theory
Fine Hall 224 / -
Nov 11

Oleg Pikhurko, Carnegie-Mellon University

Hypergraph Turan Problem
Fine Hall 224 / -
Oct 28

Amanda Redlich, Rutgers University

Unbalanced Allocations
Fine Hall 224 / -
Oct 21

Ido Ben-Eliezer, Tel Aviv University

The size Ramsey number of a directed path
Fine Hall 224 / -
Oct 14

Ofer Neiman, Courant Institute, NYU

Nearly Tight Low Stretch Spanning Trees
Fine Hall 224 / -
Oct 07

Swastik Kopparty, IAS

Random Graphs and the Parity Quantifier
Fine Hall 224 / -
Sep 30

Irena Penev, Columbia University

Bounding chromatic number for graphs in Forb*(bull)
Fine Hall 224 / -
Sep 23

Sergey Norin, Princeton University

Asymptotic extremal graph theory is non-trivial
Fine Hall 224 / -
Sep 16

Eli Berger, University of Haifa

Unfriendly partition of graphs without an infinite subdivided clique
Fine Hall 224 / -