AMS Sectional Meeting Program by Special Session

Current as of Sunday, October 16, 2005 01:09:10

Associate secretaries:
Lesley M Sibner, AMS lsibner@duke.poly.edu

Saturday October 8, 2005, 9:10 a.m.-10:45 a.m.
Special Session on Extremal and Probablistic Combinatorics, I
Room 204, Olin Hall
Organizers:
Benjamin Sudakov, Princeton University bsudakov@math.princeton.edu
- 9:10 a.m.
  Co-degree density of the Fano plane.
  Dhruv Mubayi*, University of Illinois at Chicago
  (1009-05-79)
- 9:45 a.m.
  A note on the Karp-Sipser algorithm.
  Tom Bohman*, Carnegie Mellon University
  Alan Frieze, Carnegie Mellon University
  (1009-05-95)
- 10:20 a.m.
  The game chromatic number of random graphs.
  Tom Bohman, Carnegie Mellon University
  Alan Frieze*, Carnegie Mellon University
  Benny Sudakov, Princeton University
  (1009-05-83)

Saturday October 8, 2005, 2:40 p.m.-4:50 p.m.
Special Session on Extremal and Probablistic Combinatorics, II
Room 204, Olin Hall
Organizers:
Benjamin Sudakov, Princeton University bsudakov@math.princeton.edu
- 2:40 p.m.
  Some correlation inequalities.
  Jeff Kahn*, Rutgers University
  (1009-05-98)
- 3:15 p.m.
  An algorithmic version of the hypergraph regularity method.
  Penny Haxel*, University of Waterloo
  Brendan Nagle, University of Nevada
  Vojta Rodl, Emory University
  (1009-05-87)
- 3:50 p.m.
  Ramsey-type results for the hypercube.
  Noga Alon, Tel Aviv University
  Rados Radoicic, Rutgers University
  Benny Sudakov, Princeton University
  Jan Vondrak*, Microsoft Research
  (1009-05-82)
- 4:25 p.m.
  Product Representations of Polynomials.
  Jacques Verstraete*, University of Waterloo
  (1009-05-81)

Sunday October 9, 2005, 9:10 a.m.-10:45 a.m.
Special Session on Extremal and Probablistic Combinatorics, III
Room 204, Olin Hall
Organizers:
Benjamin Sudakov, Princeton University bsudakov@math.princeton.edu
- 9:10 a.m.
  On the VC-dimension of Uniform Hypergraphs.
  Dhruv Mubayi, University of Illinois at Chicago
  Yi Zhao*, Georgia State University
  (1009-05-92)
- 9:45 a.m.
  On product anti-magic graphs.
  Oleg Pikhurko*, Carnegie Mellon University
  (1009-05-100)
- 10:20 a.m.
  Non-crossing matchings and paths in randomly labeled planar point sets.
  Jozsef Balogh*, University of Illinois at Urbana-Champaign
  Boris Pittel, Ohio State University
  Gelasio Salazar, IICO-UASLP
  (1009-05-114)

Sunday October 9, 2005, 2:40 p.m.-4:50 p.m.
Special Session on Extremal and Probablistic Combinatorics, IV
Room 204, Olin Hall
Organizers:
Benjamin Sudakov, Princeton University bsudakov@math.princeton.edu
- 2:40 p.m.
  Giant component and Poisson Cloning Model.
  Jeong Han Kim*, Microsoft Research
  (1009-05-94)
- 3:15 p.m.
  Pairwise intersections and forbidden configurations.
  Richard Anstee, UBC
  Peter Keevash*, Caltech
  (1009-05-80)
- 3:50 p.m.
  On the diameter of separated point sets with many nearly equal distances.
  Janos Pach, CUNY and NYU
  Rados Radoicic*, Rutgers University
  Jan Vondrak, Microsoft Research
  (1009-05-93)
- 4:25 p.m.
  Random $\{0,1\}$ matrices.
  Van Vu*, UCSD and Rutgers University
  (1009-05-86)

Inquiries: meet@ams.org