AMS :: 2011 Fall Central Section Meeting, AMS Special Session

AMS Sectional Meeting AMS Special Session

Current as of Sunday, October 23, 2011 00:29:39

Associate secretaries:

Georgia Benkart, AMS benkart@math.wisc.edu

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 Nebraska-Lincoln hartke@math.unl.edu
Jamie Radcliffe, University of Nebraska-Lincoln
- 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
  (1074-05-44)
- 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
  (1074-05-36)
- 5:00 p.m.
  Identification of strategies for liar-type 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
  (1074-05-271)
- 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
  (1074-05-227)

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 Nebraska-Lincoln hartke@math.unl.edu
Jamie Radcliffe, University of Nebraska-Lincoln
- 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
  (1074-05-194)
- 9:00 a.m.
  Residues and independence numbers of unigraphs.
  Michael D. Barrus*, Black Hills State University
  (1074-05-256)
- 9:30 a.m.
  Pancyclicity of 4-Connected, Claw-Free, $P_{10}$-Free Graphs.
  Michael Ferrara*, University of Colorado Denver
  TImothy Morris, University of Colorado Denver
  Paul Wenger, University of Colorado Denver
  (1074-05-156)
- 10:00 a.m.
  Finding Large Induced Subgraphs.
  Hemanshu Kaul*, Illinois Institute of Technology
  (1074-05-318)
- 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
  (1074-05-175)

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 Nebraska-Lincoln hartke@math.unl.edu
Jamie Radcliffe, University of Nebraska-Lincoln
- 2:30 p.m.
  Degree Ramsey numbers of double-stars.
  William B. Kinnersley*, University of Illinois at Urbana-Champaign
  Kevin G. Milans, University of South Carolina
  Douglas B. West, University of Illinois at Urbana-Champaign
  (1074-05-302)
- 3:00 p.m.
  Anti-Ramsey number of matchings in hypergraphs.
  Michael Young*, Iowa State University
  Lale Ozkahya, Iowa State University
  (1074-05-159)
- 3:30 p.m.
  $\delta(G)$-Size Rainbow Matchings in Properly Edge-Colored 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
  (1074-05-155)
- 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
  (1074-05-278)

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 Nebraska-Lincoln hartke@math.unl.edu
Jamie Radcliffe, University of Nebraska-Lincoln
- 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
  (1074-05-217)
- 8:30 a.m.
  Combinatorial Proofs of Some Chromatic Polynomial Constraints.
  Rebecca I. Swanson*, Nebraska Wesleyan University
  (1074-05-277)
- 9:00 a.m.
  On the Chromatic Thresholds of Hypergraphs.
  J Balogh, University of Illinois at Urbana-Champaign
  J Butterfield*, University of Illinois at Urbana-Champaign
  P Hu, University of Illinois at Urbana-Champaign
  J Lenz, University of Illinois at Chicago
  D Mubayi, University of Illinois at Chicago
  (1074-05-255)
- 10:00 a.m.
  Counting graph homomorphisms.
  David Galvin*, University of Notre Dame
  (1074-05-62)
- 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
  (1074-05-183)
- 11:00 a.m.
  Spectra of Hypergraphs.
  Joshua N Cooper*, University of South Carolina
  Aaron Dutle, University of South Carolina
  (1074-05-287)