AMS Sectional Meeting Program by AMS Special Session

Current as of Saturday, March 19, 2011 00:24:29

---

Program  ·  Deadlines  ·  Registration/Housing/Etc.
Inquiries: meet@ams.org

---

2011 Spring Southeastern Section Meeting
Statesboro, GA, March 12-13, 2011 (Saturday - Sunday)
Meeting #1068

Associate secretaries:

Matthew Miller, AMS miller@math.sc.edu

---

Special Session on Applied Combinatorics

• Saturday March 12, 2011, 8:00 a.m.-10:50 a.m.
  Special Session on Applied Combinatorics, I
  Room 2206, College of Information Technology
  Organizers:
  Hua Wang, Georgia Southern University hwang@georgiasouthern.edu
  Miklos Bona, University of Florida
  Laszlo Szekely, University of South Carolina
  

  • 8:00 a.m.
    Usage of Balloons in Regular Graphs.
    Suil O*, University of Illinois at Urbana-Champaign
    Sebastian Cioaba, University of Delaware at Newark
    Douglas B West, University of Illinois at Urbana-Champaign
    (1068-05-10)
  • 8:30 a.m.
    $K_5$-subdivisions in 5-connected nonplanar graphs.
    Jie Ma, Georgia Institute of Technology
    Xingxing Yu*, Georgia Institute of Technology
    (1068-05-331)
  • 9:00 a.m.
    Cycle-saturated graphs with minimum number of edges.
    Younjin Kim*, University of Illinois at Urbana-Champaign
    Zoltan Furedi, University of Illinois at Urbana-Champaign
    (1068-05-135)
  • 9:30 a.m.
    Minimum Degree and Disjoint Cycles in Claw-free Graphs.
    Ralph J. Faudree, University of Memphis
    Ronald J. Gould*, Emory University
    Michael S. Jacobson, University of Colorado Denver
    (1068-05-35)
  • 10:00 a.m.
    Homomorphically Irreducible Trees in Locally Connected Graphs.
    Guantao Chen*, Georgia State University
    Songling Shan, Georgia State University
    Han Ren, East China Normal University, Shanghai, China
    (1068-05-247)
  • 10:30 a.m.
    Minimum degree thresholds for bipartite graph tiling.
    Albert Bush, Georgia Institute of Technology
    Yi Zhao*, Georgia State University
    (1068-05-76)
• Saturday March 12, 2011, 2:30 p.m.-5:20 p.m.
  Special Session on Applied Combinatorics, II
  Room 2206, College of Information Technology
  Organizers:
  Hua Wang, Georgia Southern University hwang@georgiasouthern.edu
  Miklos Bona, University of Florida
  Laszlo Szekely, University of South Carolina
  

  • 2:30 p.m.
    Meanders and RNA Folding.
    Christine E Heitsch*, Georgia Tech
    (1068-05-291)
  • 3:00 p.m.
    Higher dimensional transversals in $M$ dimensional grids.
    Harout Aydinian, University of Bielefeld
    Eva Czabarka*, University of South Carolina
    Laszlo A Szekely, University of South Carolina
    (1068-05-208)
  • 3:30 p.m.
    Neighborhood sums under graph labelings.
    Peter J Slater*, University of Alabama in Huntsville
    (1068-05-327)
  • 4:00 p.m.
    Finding at least one excellent element in two rounds.
    Gyula O.H. Katona*, Renyi Institute
    (1068-05-172)
  • 4:30 p.m.
    Binary subtrees with few path labels.
    Rod Downey, Victoria University of Wellington
    Noam Greenberg, Victoria University of Wellington
    Carl G Jockusch, University of Illinois at Urbana-Champaign
    Kevin G Milans*, University of South Carolina
    (1068-05-236)
  • 5:00 p.m.
    Vertex-coloring edge-weightings.
    Michal Karonski*, Emory University and AMU
    (1068-05-157)
• Sunday March 13, 2011, 8:00 a.m.-10:50 a.m.
  Special Session on Applied Combinatorics, III
  Room 2206, College of Information Technology
  Organizers:
  Hua Wang, Georgia Southern University hwang@georgiasouthern.edu
  Miklos Bona, University of Florida
  Laszlo Szekely, University of South Carolina
  

  • 8:00 a.m.
    Counting Tree Orbits Under Permutation Group Action - An Application to Viral Shell Assembly.
    Andrew Vince*, University of Florida
    Meera Sitharam, Department of Computer Science, University of Florida
    Miklos Bona, University of Florida
    (1068-05-21)
  • 8:30 a.m.
    Goncarov-Type Polynomials and Applications in Combinatorics.
    Joseph Kung, University of North Texas
    Xinyu Sun, Tulane University
    Catherine Yan*, Texas A&M University
    (1068-05-72)
  • 9:00 a.m.
    New Bounds on van der Waerden-type Numbers for Generalized 3-term Arithmetic Progressions.
    Patrick Allen, University of Maryland - Baltimore County
    Bruce M Landman*, University of West Georgia
    Holly Meeks, University of West Georgia
    (1068-05-67)
  • 9:30 a.m.
    André permutations and similar permutation classes avoiding a single barred (generalized) pattern.
    Gabor Hetyei*, University of North Carolina at Charlotte
    (1068-05-171)
  • 10:00 a.m.
    A Fractional Analogue of Brooks' Theorem.
    Linyuan Lu*, University of South Carolina
    Xing Peng, University of South Carolina
    (1068-05-240)
  • 10:30 a.m.
    Spectra of Hypergraphs.
    Joshua N Cooper*, University of South Carolina
    Aaron Dutle, University of South Carolina
    (1068-05-267)
• Sunday March 13, 2011, 2:30 p.m.-5:20 p.m.
  Special Session on Applied Combinatorics, IV
  Room 2206, College of Information Technology
  Organizers:
  Hua Wang, Georgia Southern University hwang@georgiasouthern.edu
  Miklos Bona, University of Florida
  Laszlo Szekely, University of South Carolina
  

  • 2:30 p.m.
    Nested Chain Decompositions in Normalized Matching Posets.
    Shahriar Shahriari*, Pomona College
    (1068-06-223)
  • 3:00 p.m.
    Antichains in the Product of Chains.
    William T. Trotter*, Georgia Institute of Technology
    Noah Streib, Georgia Institute of Technology
    (1068-05-101)
  • 3:30 p.m.
    Determinant identities, electrical networks, and enumeration of spanning trees on lattices.
    Elmar Teufl, University of Tübingen
    Stephan Wagner*, Stellenbosch University
    (1068-05-34)
  • 4:00 p.m.
    Harp-free Families of Subsets.
    Jerrold R. Griggs*, University of South Carolina
    Wei-Tian Li, University of South Carolina
    Linyuan Lu, University of South Carolina
    (1068-05-142)
  • 4:30 p.m.
    The Largest Poset-Free Families and the Maximum Lubell Function Value.
    Jerrold R. Griggs, University of South Carolina
    Wei-Tian Li*, University of South Carolina
    Linyuan Lu, University of South Carolina
    (1068-05-227)
  • 5:00 p.m.
    Some Lower Bounds on the Independence Number of a Graph.
    Rao Li*, University of South Carolina Aiken
    (1068-05-128)

Inquiries: meet@ams.org

---