Speakers for the Fall Semester 2010
September 14 303 Mudd
Eli Berger
(Haifa University)
Unfriendly partition for graphs without an infinite
subdivided clique
September 21 303 Mudd
Paul Seymour (Princeton)
Disjoint paths in tournaments
September 28 303 Mudd
No seminar
October 5 303 Mudd
Gabor Kun
(IAS), Cops and robbers in random graphs
October 12 303 Mudd
Doron Zeilberger
(Rutgers), How do I walk to thee? Let me count the ways
October 19 303 Mudd
Sergey Norin (Princeton),
Perfect matchings in cubic graphs: A proof of the
Lovasz-Plummer conjecture.
October 26 303 Mudd
No seminar
November 2 303 Mudd
No seminar---University Holiday
November 9 303 Mudd
Gregory Bard (Fordham),
A new technique for solving polynomial systems of
equations over finite fields via stochastic local search
November 16 303 Mudd
Amanda Redlich (Rutgers),
Unbalanced Allocations
November 23 303 Mudd
David Conlon (Cambridge),
An approximate version of Sidorenko's conjecture
November 30 303 Mudd
David Phillips
(The College of William & Mary, and Brown University),
First-order methods for finding weighted graphs with
high algebraic connectivity
December 7 303 Mudd
Noga Alon
(Tel Aviv University & IAS),
Hypergraph list coloring and Euclidean Ramsey Theory
Past Talks
Spring 2010
Fall 2009
Spring 2009
Fall 2008
Spring 2008
Fall 2007
If you have any questions, or would like to be added to the seminar
mailing list,
please e-mail
[email protected]