
AMS Sectional Meeting Program by AMS Special Session
Current as of Sunday, March 27, 2011 00:23:13
Program ·
Deadlines ·
Registration/Housing/Etc.
Inquiries: meet@ams.org
2011 Spring Central Section Meeting
Iowa City, IA, March 1820, 2011 (Friday  Sunday)
Meeting #1069
Associate secretaries:
Georgia Benkart, AMS benkart@math.wisc.edu
Special Session on Graph Theory I

Friday March 18, 2011, 2:30 p.m.4:20 p.m.
Special Session on Graph Theory I
Rm 348 Illinois, Iowa Memorial Union Bldg Organizers: Maria Axenovich, Iowa State University axenovic@iastate.edu Lale Ozkahya, Iowa State University Michael Young, Iowa State University

Saturday March 19, 2011, 8:00 a.m.10:50 a.m.
Special Session on Graph Theory II
Rm 348 Illinois, Iowa Memorial Union Bldg Organizers: Maria Axenovich, Iowa State University axenovic@iastate.edu Lale Ozkahya, Iowa State University Michael Young, Iowa State University

8:00 a.m.
On a class of colorcritical graphs and hypergraphs.
Alexandr Kostochka*, University of Illinois at UrbanaChampaign
(10690555)

8:30 a.m.
Isomorphfree generation of 2connected graphs with applications.
Derrick Stolee*, University of NebraskaLincoln
(10690546)

9:00 a.m.
Ramsey Functions for QuasiProgressions with Large Diameter.
Adam Jobson, University of Louisville
Andre Kezdy*, University of Louisville
Hunter Snevily, University of Idaho at Moscow, ID
Susan C. White, University of Louisville
(106905119)

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

10:00 a.m.
Counting homomorphisms.
Jonathan Cutler, Montclair State University
Andrew J Radcliffe*, University of NebraskaLincoln
(106905109)

10:30 a.m.
Cyclesaturated graphs with minimum number of edges.
Younjin Kim*, University of Illinois at UrbanaChampaign
Zoltan Furedi, University of Illinois at UrbanaChampaign
(106905145)

Saturday March 19, 2011, 2:30 p.m.5:20 p.m.
Special Session on Graph Theory III
Rm 348 Illinois, Iowa Memorial Union Bldg Organizers: Maria Axenovich, Iowa State University axenovic@iastate.edu Lale Ozkahya, Iowa State University Michael Young, Iowa State University

2:30 p.m.
2cancellative uniform hypergraphs.
Zoltan Furedi*, UIUC, UrbanaChampaign, IL, USA and Renyi Institute, Budapest
(106905326)

3:00 p.m.
Equitable orientations of hypergraphs.
Yair Caro, University of Haifa  Oranim
Douglas B. West*, University of Illinois  Urbana
Raphael Yuster, University of Haifa  Haifa
(106905155)

3:30 p.m.
Embedding spanning trees.
Bela Csaba*, Dept. of Mathematics and Comp. Sci., Western Kentucky University
Asif Jamshed, Dept. of Computer Science, Rutgers University
Endre Szemeredi, Dept. of Computer Science, Rutgers University
(106905211)

4:00 p.m.
Clique number of graphs with high chromatic number.
Csaba Biro*, University of Louisville
(106905299)

4:30 p.m.
A Simultaneous Random Walk Game.
Andrew Beveridge*, Macalester College
Jorge Banuelos, Macalester College
(10690566)

5:00 p.m.
Unavoidable subhypergraphs: {\bf a}clusters.
Zoltan Furedi, University of Illinois at UrbanaChampaign and Hungarian Academy of Sciences
Lale Ozkahya*, Iowa State University
(106905239)

Sunday March 20, 2011, 8:00 a.m.10:20 a.m.
Special Session on Graph Theory IV
Rm 348 Illinois, Iowa Memorial Union Bldg Organizers: Maria Axenovich, Iowa State University axenovic@iastate.edu Lale Ozkahya, Iowa State University Michael Young, Iowa State University

8:00 a.m.
Graph Packing and Degree Sequences.
Hemanshu Kaul*, Illinois Institute of Technology
(106905323)

8:30 a.m.
Finding many edgedisjoint 1factors in dense graphs.
Stephen G. Hartke*, University of NebraskLincoln
Tyler Seacrest, University of NebraskaLincoln
(106905349)

9:00 a.m.
Quickly Coloring Graphs with Small Arboricity.
Kishore Kothapalli, International Institute of Information Technology, Hyderabad, India
Sriram V Pemmaraju*, Department of Computer Science, The University of Iowa
(106968322)

9:30 a.m.
Induced Saturation Number.
Ryan Martin, Iowa State University
Jason J Smith*, Iowa State University
(106900250)

10:00 a.m.
Graphs containing triangles are not $3$common.
Michael Young*, Iowa State University
James Cummings, Carnegie Mellon University
(106905156)
Inquiries: meet@ams.org

