AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:21:27
Program 
Deadlines 
Registration/Housing/Etc. 
Inquiries: meet@ams.org
2001 Spring Southeastern Section Meeting
Columbia, SC, March 1618, 2001
Meeting #963
Associate secretaries:
John L Bryant, AMS
bryant@math.fsu.edu
Special Session on Combinatorics and Graph Theory

Friday March 16, 2001, 9:30 a.m.11:50 a.m.
Special Session on Combinatorics and Graph Theory, I
Room 402, Gambrell Hall
Organizers:
Jerrold R. Griggs, University of South Carolina, Columbia griggs@math.sc.edu

9:30 a.m.
Domination DotCritical Graphs.
David P Sumner*, University of South Carolina
Tamara A Burton, University of South Carolina
(96305231)

10:00 a.m.
Grundy and Parsimoneous Proper Colorings of Graphs.
S T Hedetniemi, Clemson University
R. C. Laskar*, Clemson University
(96305111)

10:30 a.m.
A distancedegree condition and nonseparating paths.
Stephen C Locke*, Florida Atlantic University
H.J. Voss, Technical University Dresden
(96305241)

11:00 a.m.
Shattering News.
Richard P Anstee, University of British Columbia
Lajos Ronyai, Computer and Automation Institute, Hungarian
Attila Sali*, Department of Computer Science, Indiana UniversityPurdue University at Fort Wayne
(96305240)

11:30 a.m.
Equitable colorings of outerplanar graphs.
Alexandr V Kostochka*, University of Illinois at UrbanaChampaign
(96305118)

Friday March 16, 2001, 2:30 p.m.5:20 p.m.
Special Session on Combinatorics and Graph Theory, II
Room 402, Gambrell Hall
Organizers:
Jerrold R. Griggs, University of South Carolina, Columbia griggs@math.sc.edu

2:30 p.m.
On the circularcoloring integer critical graphs.
Bing Zhou*, Trent University
(96305166)

3:00 p.m.
The relaxed coloring game on chordal graphs.
Charles Dunn, Arizona State University
H. A Kierstead*, Arizona State University
(96305242)

3:30 p.m.
Defective Coloring Revisited.
Lenore Cowen*, Johns Hopkins University
(96305232)

4:00 p.m.
Graph Minors and Reliable Single Message Transmission.
Andre Kundgen*, California State University, San Marcos
Faith E Fich, University of Toronto
Mike Pelsmajer, University of Illinois
Radhika Ramamurthi, University of Illinois
(96305191)

4:30 p.m.
Density of Integral Sets with Missing Differences.
Daphne DerFen Liu*, California State University, Los Angeles
Xuding Zhu, National Sun Yatsen University, Taiwan
(96305187)

5:00 p.m.
Graph Partitions.
Pavol Hell*, Simon Fraser University
(96305147)

Saturday March 17, 2001, 9:30 a.m.10:50 a.m.
Special Session on Combinatorics and Graph Theory, III
Room 402, Gambrell Hall
Organizers:
Jerrold R. Griggs, University of South Carolina, Columbia griggs@math.sc.edu

9:30 a.m.
Generalized sumfree sets in abelian groups and constructions of spherical designs.
B\'{e}la Bajnok*, Gettysburg College
(9630592)

10:00 a.m.
On the Erd\H{o}sSimonovitsS\'os Conjecture about the antiRamsey numbers of cycles.
Tao Jiang, Michigan Technological University
Douglas B West*, University of Illinois
(96305137)

10:30 a.m.
New types of coding problems.
Gyula O.H. Katona*, R\'enyi Institute
(96305234)

Saturday March 17, 2001, 3:00 p.m.6:20 p.m.
Special Session on Combinatorics and Graph Theory, IV
Room 402, Gambrell Hall
Organizers:
Jerrold R. Griggs, University of South Carolina, Columbia griggs@math.sc.edu

3:00 p.m.
40\% of a conjecture of F\"{u}redi on chain partitions of the Boolean lattice.
Timothy M Hsu, Pomona College
Mark Logan, Claremont McKenna College
Shahriar Shahriari*, Pomona College
Christopher Towse, Scripps College
(9630558)

3:30 p.m.
Polynomial LYMinequalities.
Christian Bey*, University of Rostock, Germany
(96305194)

4:00 p.m.
Some New Results on IsoperimetricType Problems.
Sergei L Bezrukov*, University of Wisconsin  Superior
(9630578)

4:30 p.m.
Circular Permutations with Low Discrepancy Consecutive $k$sums.
Richard P Anstee*, U.B.C., Canada
Ron Ferguson, U.B.C., Canada
Jerrold R Griggs, University of South Carolina
(96305164)

5:00 p.m.
Meet and join within the lattice of set partitions.
Rod Canfield*, University of Georgia
(96305131)

5:30 p.m.
Problem session

Sunday March 18, 2001, 9:30 a.m.12:20 p.m.
Special Session on Combinatorics and Graph Theory, V
Room 402, Gambrell Hall
Organizers:
Jerrold R. Griggs, University of South Carolina, Columbia griggs@math.sc.edu

9:30 a.m.
Protein structure matching  an extension of the largest clique size in Erd\H osR\'enyi random graphs.
\'Eva Czabarka*, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
Stephen H Bryant, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
Tom Madej, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
John L Spouge, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
(96305172)

10:00 a.m.
How many disjoint 2edge paths must a cubic graph have?
Dhruv Mubayi*, Georgia Tech
Alexander Kelmans, University of Peurto Rico and Rutgers University
(96305152)

10:30 a.m.
Diregularity of digraphs close to Moore bound.
Mirka Miller*, University of Newcastle
(96305245)

11:00 a.m.
Break

11:30 a.m.
Long cycles through specified edgesin $k$connected graphs.
Tristan M Denley*, University of Mississippi
Haidong Wu, University of Mississippi
(96305195)

12:00 p.m.
Edge list multicoloring trees: An extension of Hall's theorem.
Matthew Cropper, Eastern Kentucky University
Andras Gyarfas, Hungarian Academy of Sciences
Jeno Lehel*, University of Louisville
(96305247)
Inquiries: meet@ams.org