AMS Sectional Meeting Program by AMS Special Session

Current as of Sunday, October 17, 2010 00:33:02

Program | Deadlines | Registration/Housing/Etc.
Special Event or Lecture | Inquiries: meet@ams.org

Associate secretaries:
Michel L Lapidus, AMS lapidus@math.ucr.edu, lapidus@mathserv.ucr.edu

Saturday October 9, 2010, 9:00 a.m.-10:50 a.m.
Special Session on Extremal and Probabilistic Combinatorics, I
MS 5203, Math Science Building
Organizers:
Benny Sudakov, University of California Los Angeles bsudakov@math.ucla.edu
Jacques Verstraete, University of California San Diego jbaverstraete@gmail.com
- 9:00 a.m.
  The Structure of Typical Hypergraphs with Local Constraints.
  Dhruv Mubayi*, University of Illinois-Chicago
  Jozsef Balogh, UIUC
  (1063-05-77)
- 9:30 a.m.
  Conflict-free colorings of uniform hypergraphs with few edges.
  Alexandr Kostochka*, University of Illinois
  Mohit Kumbhat, University of Illinois
  Tomasz Luczak, Adam Mickiewicz University, Poznan, Poland
  (1063-05-64)
- 10:00 a.m.
  Quasi-randomness of graph balanced cut properties.
  Choongbum Lee*, UCLA
  Hao Huang, UCLA
  (1063-05-125)
- 10:30 a.m.
  Upper tails for cliques.
  Jeff Kahn*, Rutgers University
  (1063-05-136)

Saturday October 9, 2010, 3:00 p.m.-5:20 p.m.
Special Session on Extremal and Probabilistic Combinatorics, II
MS 5203, Math Science Building
Organizers:
Benny Sudakov, University of California Los Angeles bsudakov@math.ucla.edu
Jacques Verstraete, University of California San Diego jbaverstraete@gmail.com
- 3:00 p.m.
  The cutoff phenomenon on explicit expanders.
  Eyal Lubetzky*, Microsoft Research
  (1063-60-165)
- 3:30 p.m.
  A counterexample to the Alon-Saks-Seymour conjecture and related problems.
  Hao Huang*, University of California, Los Angeles
  Benjamin Sudakov, University of California, Los Angeles
  (1063-05-54)
- 4:00 p.m.
  Discussion
- 4:30 p.m.
  Self-correcting estimates from the differential equations method.
  Tom Bohman*, Carnegie Mellon University
  Alan Frieze, Carnegie Mellon University
  Eyal Lubetzky, Microsoft Research
  (1063-05-78)
- 5:00 p.m.
  Large $B_d$-free subfamilies.
  Zoltan Furedi*, University of Illinois at Urbana-Champaign
  (1063-05-255)

Sunday October 10, 2010, 9:00 a.m.-10:50 a.m.
Special Session on Extremal and Probabilistic Combinatorics, III
MS 5203, Math Science Building
Organizers:
Benny Sudakov, University of California Los Angeles bsudakov@math.ucla.edu
Jacques Verstraete, University of California San Diego jbaverstraete@gmail.com
- 9:00 a.m.
  Asymptotic enumeration of sparse 2-connected graphs.
  Graeme Kemkes, University of California at San Diego
  Cristiane Sato, University of Waterloo
  Nicholas Wormald*, University of Waterloo
  (1063-05-80)
- 9:30 a.m.
  On a Conjecture of Frankl and Füredi.
  Ameera Naz Chowdhury*, UC San Diego
  (1063-05-87)
- 10:00 a.m.
  Flipping edges and vertices in graphs.
  Fan Chung*, University of California, San Diego
  Ronald L. Graham, University of California, San Diego
  (1063-05-164)
- 10:30 a.m.
  On Schnyder's Theorem.
  P Haxell*, University of Waterloo
  (1063-05-276)