AMS Sectional Meeting Program by AMS Special Session
Current as of Saturday, November 13, 2010 00:34:10
Program 
Deadlines 
Registration/Housing/Etc.
Inquiries: meet@ams.org
2010 Fall Central Section Meeting
Notre Dame, IN, November 57, 2010 (Friday  Sunday)
Meeting #1064
Associate secretaries:
Georgia Benkart, AMS
benkart@math.wisc.edu
Special Session on Graphs and Hypergraphs

Friday November 5, 2010, 2:30 p.m.4:20 p.m.
Special Session on Graphs and Hypergraphs, I
Room 119, DeBartolo Hall
Organizers:
David Galvin, University of Notre Dame David.Galvin.12@nd.edu
Hemanshu Kaul, Illinois Institute of Technology kaul@math.iit.edu

2:30 p.m.
The number of noncrossing perfect matchings compatible with a 2coloring.
Todd Kemp, Math Dept, University of California San Diego
Karl Mahlburg, Math Dept, Princeton University
Amarpreet Rattan, Department of Economics, Mathematics and Statistics, Birbeck, University of London
Clifford Smyth*, Dept of Math University of North Carolina Greensboro
(106405279)

3:00 p.m.
Vertex Identifying Codes on The Hexagonal Grid.
Brendon Stanton*, Iowa State University
(106405178)

3:30 p.m.
A posetbased approach to embedding median graphs in hypercubes and lattices.
Christine T. Cheng*, University of WisconsinMilwaukee
(10640558)

4:00 p.m.
Realizability of Graphs and Linkages.
Marcus Schaefer*, DePaul University
(106405249)

Saturday November 6, 2010, 8:30 a.m.10:50 a.m.
Special Session on Graphs and Hypergraphs, II
Room 119, DeBartolo Hall
Organizers:
David Galvin, University of Notre Dame David.Galvin.12@nd.edu
Hemanshu Kaul, Illinois Institute of Technology kaul@math.iit.edu

8:30 a.m.
Cyclesaturated graphs with minimum number of edges.
Zoltan Furedi*, University of Illinois at UrbanaChampaign Urbana, IL 61801, USA
(106405281)

9:00 a.m.
Edgeconnectivity, eigenvalues, and matchings in regular graphs.
Suil O*, University of Illinois at UrbanaChampaign
Sebastian Cioaba, University of Delaware at Newark
Douglas B. West, University of Illinois at UrbanaChampaign
(106405119)

9:30 a.m.
Minimum $H$decompositions of graphs: edgecritical case.
Lale Ozkahya*, Iowa State University
Yury Person, Humboldt Universitat zu Berlin
(106405268)

10:00 a.m.
Classification of $Z_2^k$magic graphs.
Jeong Ok Choi*, Trinity College, CT
John P. Georges, Trinity College, CT
David W. Mauro, Trinity College, CT
(106405274)

10:30 a.m.
The blockcutpoint tree characterization of a covering polynomial of a graph.
Robert B. Ellis*, Illinois Institute of Technology
James P. Ferry, Metron, Inc.
Darren P. Lo, Metron, Inc.
Dhruv Mubayi, University of Illinois at Chicago
(106405282)

Saturday November 6, 2010, 2:30 p.m.5:20 p.m.
Special Session on Graphs and Hypergraphs, III
Room 119, DeBartolo Hall
Organizers:
David Galvin, University of Notre Dame David.Galvin.12@nd.edu
Hemanshu Kaul, Illinois Institute of Technology kaul@math.iit.edu

2:30 p.m.
The Structure of Typical Hypergraphs with Local Constraints.
Jozsef Balogh, UIUC
Dhruv Mubayi*, UIC
(106405182)

3:00 p.m.
Hypergraph independent sets.
Jonathan Cutler*, Montclair State University
A. J. Radcliffe, University of NebraskaLincoln
(106405161)

3:30 p.m.
Detachments of Amalgamated 3uniform Hypergraphs.
Amin Bahmanian*, Auburn University
(10640519)

4:00 p.m.
Set systems without a strong simples.
Tao Jiang, Miami University
Oleg Pikhurko, Carnegie Mellon University
Zelealem B Yilma*, Carnegie Mellon University
(106405159)

4:30 p.m.
Online Ramsey Games for Triangles in Random Graphs.
Jane V. Butterfield*, University of Illinois at UrbanaChampaign
József Balogh, University of Illinois at UrbanaChampaign
(106405214)

5:00 p.m.
On the ChvatalErdos triangle game.
Jozsef Balogh*, University of Illinois at UC, UCSD
Wojtek Samotij, UIUC, University of Tel Aviv, Israel
(106405186)

Sunday November 7, 2010, 8:00 a.m.11:50 a.m.
Special Session on Graphs and Hypergraphs, IV
Room 119, DeBartolo Hall
Organizers:
David Galvin, University of Notre Dame David.Galvin.12@nd.edu
Hemanshu Kaul, Illinois Institute of Technology kaul@math.iit.edu

8:00 a.m.
Degree Conditions for $H$Linked Digraphs.
Michael Ferrara*, University of Colorado Denver
Michael Jacobson, University of Colorado Denver
Florian Pfender, Universität Rostock, Rostock, Germany
(106405150)

8:30 a.m.
Each sparse graph decomposes into a forest and a graph with bounded degree.
SeogJin Kim, Konkuk University, Seoul, South Korea
Alexandr Kostochka*, University of Illinois at UrbanaChampaign
Douglas B. West, University of Illinois at UrbanaChampaign
Hehui Wu, University of Illinois at UrbanaChampaign
Xuding Zhu, Zhejiang Normal University, Jinhua, China
(106405102)

9:00 a.m.
Modular orientations of random regular graphs.
Pawel Pralat*, Department of Mathematics, West Virginia University, Morgantown, WV
(106405117)

9:30 a.m.
Longest cycles in kconnected graphs with given independence number.
Suil O, University of Illinois at UrbanaChampaign
Douglas West, University of Illinois at UrbanaChampaign
Hehui Wu*, University of Illinois at UrbanaChampaign
(10640556)

10:30 a.m.
The typical structure of $H$colorings of the Hamming cube.
John Engbers*, University of Notre Dame
David Galvin, University of Notre Dame
(106405197)

11:00 a.m.
The Number of Matchings of a Given Size.
Liviu Ilinca*, Indiana University
Jeff Kahn, Rutgers University
(106405223)

11:30 a.m.
Extremal Trees for Homomorphism Enumeration.
Andrew J Radcliffe*, University of NebraskaLincoln
Andrew Ray, University of NebraskaLincoln
(106405233)
Inquiries: meet@ams.org