AMS Sectional Meeting Program by AMS Special Session
Current as of Sunday, April 18, 2010 21:23:43
Program 
Deadlines 
Registration/Housing/Etc.
Inquiries: meet@ams.org
2010 Spring Central Section Meeting
St. Paul, MN, April 1011, 2010 (Saturday  Sunday)
Meeting #1058
Associate secretaries:
Georgia Benkart, AMS
benkart@math.wisc.edu
Special Session on Probabilistic and Extremal Combinatorics

Saturday April 10, 2010, 9:00 a.m.11:20 a.m.
Special Session on Probabilistic and Extremal Combinatorics, I
Room 150, Olin Rice Hall
Organizers:
Ryan Martin, Iowa State University rymartin@iastate.edu
Maria Axenovich, Iowa State University axenovic@iastate.edu

9:00 a.m.
On Saturated Graphs.
Ronald J. Gould*, Emory University
(10580572)

9:30 a.m.
Stability results on covering of triangles by edges.
P. Haxell, University of Waterloo
A. Kostochka*, University of Illinois at UrbanaChampaign
S. Thomasse, Universite Montpellier II
(105805196)

10:00 a.m.
Extremal trees for homomorphism enumeration.
A. Jamie Radcliffe*, University of NebraskaLincoln
Andrew Ray, University of NebraskaLincoln
(105805119)

10:30 a.m.
Covering complete $r$graphs with complete $r$partite $r$graphs.
André Kündgen*, California State University San Marcos
Sebastian Cioabă, University of Delaware
Craig Timmons, University of California San Diego
(105805267)

11:00 a.m.
Decomposition of graphs into given sample graphs.
Zoltan Furedi*, University of Illinois at UrbanaChampaign
(105805269)

Saturday April 10, 2010, 2:00 p.m.4:50 p.m.
Special Session on Probabilistic and Extremal Combinatorics, II
Room 150, Olin Rice Hall
Organizers:
Ryan Martin, Iowa State University rymartin@iastate.edu
Maria Axenovich, Iowa State University axenovic@iastate.edu

2:00 p.m.
Fractional Chromatic Number of Trianglefree Graphs with $\Delta\leq 3$.
Linyuan Lu*, University of South Carolina
Xing Peng, University of South Carolina
(105805261)

2:30 p.m.
The Steiner problem in the hypercube.
Tao Jiang, Miami University
Zevi Miller, Miami University
Dan Pritikin*, Miami University
(105805158)

3:00 p.m.
An Extremal Characterization of Projective Planes.
Felix Lazebnik*, University of Delaware
Stefaan De Winter, Department of Mathematics and Computer Algebra, Gent University
Jacques Verstraëte, Department of Mathematics, UCSD
(105805280)

3:30 p.m.
Set systems without a strong simplex.
Tao Jiang*, Miami University
Oleg Pikhurko, Carnegie Mellon University
Zelealem Yilma, Carnegie Mellon University
(105805103)

4:00 p.m.
The Lubell function and $H$free families of subsets.
Jerrold R. Griggs*, University of South Carolina
WeiTian Li, University of South Carolina
Linyuan Lu, University of South Carolina
(105805284)

4:30 p.m.
On the Size of Maximal Antichains and the Number of Pairwise Disjoint Maximal Chains.
William T Trotter*, Georgia Institute of Technology
David M Howard, Georgia Institute of Technology
(10580560)

Sunday April 11, 2010, 8:30 a.m.10:50 a.m.
Special Session on Probabilistic and Extremal Combinatorics, III
Room 150, Olin Rice Hall
Organizers:
Ryan Martin, Iowa State University rymartin@iastate.edu
Maria Axenovich, Iowa State University axenovic@iastate.edu

8:30 a.m.
On characterising Vizing's edge colouring bound.
Penny Haxell*, University of Waterloo
(105805157)

9:00 a.m.
A spectral version of the degreediameter problem.
M Cioaba Sebastian*, Department of Mathematical Sciences, University of Delaware, Newark, DE 19713 USA
(105805100)

9:30 a.m.
Finding a large balanced bipartite subgraph with high minimum degree.
Stephen G Hartke*, University of NebraskaLincoln
Tyler Seacrest, University of NebraskaLincoln
(105805208)

10:00 a.m.
Graph Classes Determined by Convexity Notions in Graphs.
Ortrud R Oellermann*, University of Winnipeg
(105805151)

10:30 a.m.
Rainbow Matching in EdgeColored Graphs.
Timothy D. LeSaulnier, University of Illinois
Christopher Stocker, University of Illinois
Paul S. Wenger, University of Illinois
Douglas B. West*, University of Illinois
(10580567)

Sunday April 11, 2010, 2:30 p.m.4:50 p.m.
Special Session on Probabilistic and Extremal Combinatorics, IV
Room 150, Olin Rice Hall
Organizers:
Ryan Martin, Iowa State University rymartin@iastate.edu
Maria Axenovich, Iowa State University axenovic@iastate.edu

2:30 p.m.
On a conjecture of Erdos and Simonovits.
Jacques A Verstraete*, Department of Mathematics, University of California San Diego
Peter Keevash, University of London
Benny Sudakov, University of California, Los Angeles
(105805301)

3:00 p.m.
How to find a two coloring of ${1,2, ... ,n}$ that has few monochromatic constellations.
Steve Butler*, UCLA
Kevin Costello, Georgia Institute of Technology
Ron Graham, UCSD
(10580562)

3:30 p.m.
Planar graphs are 1relaxed, 4choosable.
H. A. Kierstead*, Arizona State University
William Cushing, Arizona State University
(10580597)

4:00 p.m.
An extension of Thomassen's results on 2 and 3extendable planar graphs.
Joan P. Hutchinson*, Macalester College
(105805148)

4:30 p.m.
Exit frequency matrices for finite Markov chains.
Andrew J Beveridge*, Macalester College
Laszlo Lovasz, Eotvos Lorand University
(105805298)
Inquiries: meet@ams.org