AMS Sectional Meeting Program by Special Session
Current as of Saturday, April 4, 2009 00:27:23
Program 
Deadlines 
Registration/Housing/Etc. 
Special Event or Lecture 
Inquiries: meet@ams.org
2009 Spring Central Sectional Meeting
Urbana, IL, March 2729, 2009 (Friday  Sunday)
Meeting #1047
Associate secretaries:
Susan J Friedlander, AMS
susan@math.northwestern.edu
Special Session on Probabilistic and Extremal Combinatorics

Friday March 27, 2009, 2:00 p.m.5:20 p.m.
Special Session on Probabilistic and Extremal Combinatorics, I
Room 163, Noyes Lab
Organizers:
Jozsef Balogh, University of Illinois at UrbanaChampaign jobal@math.uiuc.edu
Zoltan Furedi, University of Illinois at UrbanaChampaign zfuredi@math.uiuc.edu

2:00 p.m.
New results in ErdosFranklRodl theory.
Jozsef Balogh, University of Illinois at UrbanaChampaign
Bela Bollobas, Cambridge Univerity, UK and U. of Memphis, TN
Miklos Simonovits*, Renyi Institute, Budapest, Hungary
(104705334)

2:30 p.m.
Random transceiver networks.
Paul Balister*, University of Memphis
Béla Bollobás, Cambridge University, UK, and University of Memphis
Mark Walters, Queen Mary, University of London, UK
(104760419)

3:00 p.m.
On the sumproduct problem.
Jozsef Solymosi*, Department of Mathematics. University of British Columbia
(104705307)

3:30 p.m.
Counting graphs without a fixed subgraph.
Jozsef Balogh, University of Illinois at UrbanaChampaign
Wojciech Samotij*, University of Illinois at UrbanaChampaign
(104705339)

4:00 p.m.
On the minimum degree of minimal Ramsey graphs.
Tibor Szabo*, McGill University
Philipp Zumstein, ETH Zurich
Stefanie Zuercher, ETH Zurich
(104705471)

4:30 p.m.
Independent dominating sets in graphs of girth five.
Jacques A Verstraete*, University of California San Diego
(104705481)

5:00 p.m.
Phylogenetic combinatorics.
Laszlo A Szekely*, University of South Carolina
(104705183)

Saturday March 28, 2009, 8:30 a.m.11:20 a.m.
Special Session on Probabilistic and Extremal Combinatorics, II
Organizers:
Jozsef Balogh, University of Illinois at UrbanaChampaign jobal@math.uiuc.edu
Zoltan Furedi, University of Illinois at UrbanaChampaign zfuredi@math.uiuc.edu

8:30 a.m.
Extremal problems for multipartite graphs.
Rahil Baber, University College London
J Robert Johnson, Queen Marys University of London
John Talbot*, University College London
(104705260)

9:00 a.m.
On AvoiderEnforcer games.
József Balogh, University of Illinois, UrbanaChampaign
Ryan Martin*, Iowa State University
(104705256)

9:30 a.m.
Bilinear and Quadratic Variants on the LittlewoodOfford Problem.
Kevin P Costello*, Georgia Institute of Technology
(104705441)

10:00 a.m.
Optimal Random Matchings on Trees and Applications.
Bela Csaba*, Dept. of Mathematics, Western Kentucky University
Ali Shokoufandeh, Dept. of Computer Science, Drexel University
Jeff Abrahamson, Dept. of Computer Science, Drexel University
(104705266)

10:30 a.m.
Extremal problems for counting homomorphisms.
Jonathan Cutler*, Montclair State University
A. J. Radcliffe, University of NebraskaLincoln
(104705276)

11:00 a.m.
A simple entropy proof of the KahnLovasz theorem.
Andrew J. Radcliffe*, University of NebraskaLincoln
Jonathan Cutler, Montclair State University
(104705245)

Saturday March 28, 2009, 3:00 p.m.4:50 p.m.
Special Session on Probabilistic and Extremal Combinatorics, III
Room 163, Noyes Lab
Organizers:
Jozsef Balogh, University of Illinois at UrbanaChampaign jobal@math.uiuc.edu
Zoltan Furedi, University of Illinois at UrbanaChampaign zfuredi@math.uiuc.edu

3:00 p.m.
It's a long way to recurrence  an extremal problem in the Abelian Sandpile Model.
László Babai*, University of Chicago
Igor Gorodezky, Cornell University
Allie Shapiro, Toyota Technological Institute  Chicago
(104705434)

3:30 p.m.
Random ErdosKoRado.
Jozsef Balogh, UIUC
Tom Bohman, CMU
Dhruv Mubayi*, University of Illinois at Chicago
(104705118)

4:00 p.m.
New bounds in the Zarankiewicz problem.
Vladimir Nikiforov*, University of Memphis, Memphis, TN
(104705318)

4:30 p.m.
Large induced trees in $K_r$free graphs.
Jacob Fox, Princeton University
PoShen Loh*, Princeton University
Benny Sudakov, UCLA
(10470596)

Sunday March 29, 2009, 9:00 a.m.12:20 p.m.
Special Session on Probabilistic and Extremal Combinatorics, IV
Room 163, Noyes Lab
Organizers:
Jozsef Balogh, University of Illinois at UrbanaChampaign jobal@math.uiuc.edu
Zoltan Furedi, University of Illinois at UrbanaChampaign zfuredi@math.uiuc.edu

9:00 a.m.
On a Variant of van der Waerden's Theorem.
Sujith Vijay*, University of Illinois at UrbanaChampaign
(104705365)

9:30 a.m.
Combinatorial problems from and for Horn formulas.
Marina Langlois, Univ. of Illinois at Chicago, Dept. Comp. Sci.
Dhruv Mubayi, Univ. of Illinois at Chicago, Dept. Math., Stat. and Comp.Sci.
Robert H. Sloan, Univ. of Illinois at Chicago, Dept. Comp. Sci.
Gyorgy Turan*, Univ. of Illinois at Chicago, Dept. Math., Stat. and Comp.Sci.
(104705278)

10:00 a.m.
Turán type problems and polychromatic colorings on the hypercube.
David Offner*, Carnegie Mellon University
(104705366)

10:30 a.m.
Graphs with four boundary vertices and the Frame of a graph.
Attila Por*, Western Kentucky University
Tobias Muller, School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel Aviv University
JeanSebastian Sereni, CNRS (LIAFA, Universite Denis Diderot), Paris
(104705397)

11:00 a.m.
On colorings avoiding both monochromatic and rainbow subgraphs.
Maria Axenovich*, Department of Mathematics, Iowa State University
JiHyeok Choi, Iowa State University
Perry Iverson, Iowa State University
(104705273)

11:30 a.m.
Diameter of random spanning trees in a given graph.
Fan Chung, University of California, San Diego
Paul Horn, University of California, San Diego
Linyuan Lu*, University of South Carolina
(104705374)

12:00 p.m.
Thuetype games and highly nonrepetitive sequences.
Wesley Pegden*, Department of Mathematics, Rutgers University (New Brunswick)
(10470539)
Inquiries: meet@ams.org