Princeton Discrete Mathematics Seminar

Department of Mathematics
Princeton University

Organizers:
Sergey Norin
Paul Seymour



Regular meeting time: Thursday 2:15 - 3:15 P.M
Place: Fine 224

Fall 2007 Talks


Date
Speaker Title and Abstract
September 20 Sergey Norin, Princeton
Analogies between graphs and algebraic curves
September 27 Alexander Razborov, IAS
A Product Theorem in Free Groups
October 4 Maria Chudnovsky, Columbia/CMI
Even pairs in Berge graphs
October 12
(Note: unusual day)
Eli Berger, Haifa
On the duality between independence and domination
October 18 Bruce Reed, McGill
A nearly linear time algorithm for testing membership in minor closed families of graphs
October 25 Van Vu, Rutgers/IAS
Sum-product estimate via expanders
November 1 Fall recess
No seminar
November 8 Jan Vondrak, Princeton
Tree embeddings in graphs
November 15 Peter Keevash, Queen Mary, University of London
A hypergraph regularity method for generalised Turan problems
November 22 Thanksgiving
No seminar
November 29 Benny Sudakov, IAS ans UCLA
Induced Ramsey-type theorems
December 6 Wesley Pegden, Rutgers Critical triangle-free graphs with lots of edges
December 13 Endre Szemerédi, Rutgers
Embedding a bounded degree tree into a dense graph

If you want to be added to our mailing list, please email to:

   snorin@math.princeton.edu




Other seminars in Mathematics Department


Talks from Spring 2007 Talks from Fall 2006
Talks from 2005/2006 Talks from 2004/2005
Talks from 2003/2004 Talks from 2002/2003
Talks from 2001/2002 Talks from 2000/2001