Princeton Discrete Mathematics Seminar

Department of Mathematics
Princeton University

Organizers: Noga Alon, Maria Chudnovsky, Zeev Dvir, and Paul Seymour
Time:  Thursday 3:00 - 4:00
Place: Fine 224

Spring 2018

Feb 8: Noga Alon (Princeton), ``Cayley graphs and list-decodable zero-rate codes'', abstract

Feb 15: Bhargav Narayanan (Rutgers), ``Hamiltonian surfaces'', abstract

Feb 22: Shay Moran (IAS), ``On the expressiveness of comparison queries'', abstract

Mar 1: Shira Zerbib (Michigan), ``Envy-free division of a cake without the "hungry players" assumption'', abstract

Mar 8: Oliver Schaudt (Köln), ``When is a graph not 3-colorable?'', abstract

Mar 15: Bernard Lidický (Iowa State), ``On large bipartite subgraphs in dense H-free graphs'', abstract

Mar 22: spring break, no seminar

Mar 29: Tinaz Ekim (Boğaziçi U.), ``Edge-extremal graphs under degree and matching number restrictions'', abstract

Apr 5: Jaehoon Kim (U. Birmingham), ``The tree packing conjecture for bounded degree trees'', abstract

Apr 12: Fan Wei (Stanford), ``Permutation property testing'', abstract

Apr 19: Sang-Il Oum (KAIST), ``Finding branch-decompositions of matroids, hypergraphs, and more'', abstract

Apr 26: no seminar (conflict with Barbados workshop)

May 3: Shenwei Huang (Simon Fraser U.), ``Coloring (cap, even hole)-free graphs'', abstract

May 10 (1:30 pm, note the unusual time!): Martin Loebl (Charles U., Prague), ``Isomorphism of weighted trees and Stanley's conjecture for caterpillars'', abstract

Fall 2018

Sep 13: Muli Safra (U. Tel Aviv), ``The 2-to-2 Games Conjecture via expansion on the Grassmann graph'', abstract

Sep 20: Ehud Friedgut (Weizmann Inst.), ``The sharp threshold criterion and the container method; chisel and hammer'', abstract

Sep 27: Margaret Readdy (U. Kentucky), ``Geometric proofs of some combinatorial identities of Morel'', abstract

Oct 4: Michael Simkin (Hebrew U.), ``Perfect matchings in random subgraphs of regular bipartite graphs'', abstract

Oct 11: Jinyoung Park (Rutgers) ``The number of 4-colorings of the Hamming cube'', abstract

Oct 18: Clara Shikhelman (Princeton), ``Generalized Turan-type problems for random graphs'', abstract

Oct 25: Ben Lund (Princeton), ``Erdos' distinct distance problem in finite fields'', abstract

Nov 1: Fall break, no seminar

Nov 8: Alex Scott (Oxford), ``Induced trees and Erdos-Hajnal'', abstract

Nov 15: Gal Kronenberg (Tel Aviv), ``The chromatic index of random multigraphs'', abstract

Nov 22: Thanksgiving break, no seminar

Nov 29: No seminar

Dec 6: Colin Defant (Princeton), ``Structure in stack-sorting'', abstract

Dec 11: (NOTE THE UNUSUAL DATE AND TIME!) Guangming Jing (Georgia State University), ``The Goldberg-Seymour conjecture on the edge-coloring of multigraphs'', abstract

Dec 13: Sebastian Cioaba (U. Delaware), ``The smallest eigenvalues of Hamming, Johnson and other graphs'', abstract

For information about the seminar please send email to