
AMS Sectional Meeting AMS Special Session
Current as of Sunday, October 23, 2011 00:29:39
Program ·
Deadlines ·
Registration/Housing/Etc.
Special Event or Lecture ·
Inquiries: meet@ams.org
2011 Fall Central Section Meeting
University of NebraskaLincoln, Lincoln, NE
October 1416, 2011 (Friday  Sunday)
Meeting #1074
Associate secretaries:
Georgia Benkart, AMS benkart@math.wisc.edu
Special Session on Extremal and Probabilistic Combinatorics

Friday October 14, 2011, 4:00 p.m.5:50 p.m.
Special Session on Extremal and Probabilistic Combinatorics, I
Room 118, Avery Hall Organizers: Stephen Hartke, University of NebraskaLincoln hartke@math.unl.edu Jamie Radcliffe, University of NebraskaLincoln

4:00 p.m.
Hitting random set systems.
Anant Godbole*, East Tennessee State University (ETSU)
Jessie Deering, ETSU
William Jamieson, ETSU
Lucia Petito, University of Rochester
(10740544)

4:30 p.m.
The maximum size of a Sidon set contained in a sparse random set of integers.
Yoshiharu Kohayakawa, IME, University of Sao Paulo
Sangjune Lee*, Department of Math and CS, Emory University
Vojtech Rodl, Department of Math and CS, Emory University
(10740536)

5:00 p.m.
Identification of strategies for liartype games via discrepancy from their linear approximations.
Joshua N. Cooper, University of South Carolina
Robert B. Ellis*, Illinois Institute of Technology
Daniel Tietzer, Illinois Institute of Technology
James Williamson, Illinois Institute of Technology
(107405271)

5:30 p.m.
Cops and Robbers on Geometric Graphs.
Andrew Beveridge*, Macalester College
Andrzej Dudek, Western Michigan University
Alan Frieze, Carnegie Mellon University
Tobias Mueller, Centrum voor Wiskunde en Informatica
(107405227)

Saturday October 15, 2011, 8:30 a.m.10:50 a.m.
Special Session on Extremal and Probabilistic Combinatorics, II
Room 118, Avery Hall Organizers: Stephen Hartke, University of NebraskaLincoln hartke@math.unl.edu Jamie Radcliffe, University of NebraskaLincoln

8:30 a.m.
The Chinese Postman Problem in regular graphs of odd degree.
Suil O, College of William and Mary
Douglas B. West*, University of Illinois  Urbana
(107405194)

9:00 a.m.
Residues and independence numbers of unigraphs.
Michael D. Barrus*, Black Hills State University
(107405256)

9:30 a.m.
Pancyclicity of 4Connected, ClawFree, $P_{10}$Free Graphs.
Michael Ferrara*, University of Colorado Denver
TImothy Morris, University of Colorado Denver
Paul Wenger, University of Colorado Denver
(107405156)

10:00 a.m.
Finding Large Induced Subgraphs.
Hemanshu Kaul*, Illinois Institute of Technology
(107405318)

10:30 a.m.
On the edit distance for $K_{2,t}$free graphs.
Ryan R. Martin*, Iowa State University
Tracy McKay, Iowa State University
(107405175)

Saturday October 15, 2011, 2:30 p.m.4:20 p.m.
Special Session on Extremal and Probabilistic Combinatorics, III
Room 118, Avery Hall Organizers: Stephen Hartke, University of NebraskaLincoln hartke@math.unl.edu Jamie Radcliffe, University of NebraskaLincoln

2:30 p.m.
Degree Ramsey numbers of doublestars.
William B. Kinnersley*, University of Illinois at UrbanaChampaign
Kevin G. Milans, University of South Carolina
Douglas B. West, University of Illinois at UrbanaChampaign
(107405302)

3:00 p.m.
AntiRamsey number of matchings in hypergraphs.
Michael Young*, Iowa State University
Lale Ozkahya, Iowa State University
(107405159)

3:30 p.m.
$\delta(G)$Size Rainbow Matchings in Properly EdgeColored Graphs.
Jennifer Diemunsch, University of Colorado Denver
Michael Ferrara, University of Colorado Denver
Casey Moffatt, University of Colorado Denver
Florian Pfender, University of Rostock
Paul S Wenger*, University of Colorado Denver
(107405155)

4:00 p.m.
Large Rainbow Matchings in Graphs.
A. Kostochka, University of Illinois at Urbana Champaign
M. Yancey*, University of Illinois at Urbana Champaign
(107405278)

Sunday October 16, 2011, 8:00 a.m.11:20 a.m.
Special Session on Extremal and Probabilistic Combinatorics, IV
Room 118, Avery Hall Organizers: Stephen Hartke, University of NebraskaLincoln hartke@math.unl.edu Jamie Radcliffe, University of NebraskaLincoln

8:00 a.m.
Spanning trees of shifted simplicial complexes.
Caroline J Klivans, University of Chicago
Art M Duval, University of Texas, El Paso
Jeremy L Martin*, University of Kansas
(107405217)

8:30 a.m.
Combinatorial Proofs of Some Chromatic Polynomial Constraints.
Rebecca I. Swanson*, Nebraska Wesleyan University
(107405277)

9:00 a.m.
On the Chromatic Thresholds of Hypergraphs.
J Balogh, University of Illinois at UrbanaChampaign
J Butterfield*, University of Illinois at UrbanaChampaign
P Hu, University of Illinois at UrbanaChampaign
J Lenz, University of Illinois at Chicago
D Mubayi, University of Illinois at Chicago
(107405255)

10:00 a.m.
Counting graph homomorphisms.
David Galvin*, University of Notre Dame
(10740562)

10:30 a.m.
Independent sets in graphs with given minimum degree.
Jonathan Cutler*, Montclair State University
James Alexander, Montclair State University
Tim Mink, Montclair State University
(107405183)

11:00 a.m.
Spectra of Hypergraphs.
Joshua N Cooper*, University of South Carolina
Aaron Dutle, University of South Carolina
(107405287)
Inquiries: meet@ams.org

