AMS Sectional Meeting Program by Special Session

Current as of Saturday, November 11, 2006 00:30:38

Associate secretaries:
Matthew Miller, AMS miller@math.sc.edu

Friday November 3, 2006, 2:45 p.m.-5:45 p.m.
Special Session on Extremal and Probabilistic Combinatorics, I
Room 610, Science and Engineering Building
Organizers:
Jerrold R. Griggs, University of South Carolina griggs@math.sc.edu
Joshua N. Cooper, University of South Carolina cooper@math.sc.edu
- 2:45 p.m.
  Ramsey Number Problems Involving Books and Wheels.
  Cecil C. Rousseau*, University of Memphis
  (1022-05-154)
- 3:15 p.m.
  Simple counting of integer points via irrationality.
  Frank Sottile*, Texas A&M University
  (1022-05-54)
- 3:45 p.m.
  Codes that attain minimum distance in all possible directions.
  Gyula O.H. Katona, Alfr\'ed R\'enyi Institute of Mathematics, Hungarian Academy of Sciences
  Attila Sali*, Alfr\'ed R\'enyi Institute of Mathematics, Hungarian Academy of Sciences
  Klaus-Dieter Schewe, Massey University, New Zealand
  (1022-05-57)
- 4:15 p.m.
  Largest number of subtrees of trees with a given maximum degree.
  Hua Wang*, University of Florida
  Russell Kirk, University of Florida
  (1022-05-63)
- 4:45 p.m.
  Maximum Number of Colorings of $(2k,k^2)$-Graphs.
  Felix Lazebnik*, University of Delaware
  Oleg Pikhurko, Carnegie Mellon University
  Andrew J. Woldar, Villanova Unversity
  (1022-05-91)
- 5:15 p.m.
  Problem session.

Saturday November 4, 2006, 8:00 a.m.-10:50 a.m.
Special Session on Extremal and Probabilistic Combinatorics, II
Room 402, Science and Engineering Building
Organizers:
Jerrold R. Griggs, University of South Carolina griggs@math.sc.edu
Joshua N. Cooper, University of South Carolina cooper@math.sc.edu
- 8:00 a.m.
  Random Linear Extensions of Grids.
  Joshua N. Cooper*, University of South Carolina
  (1022-05-147)
- 8:30 a.m.
  On a problem of Erd\H{o}s and Lov\'asz on coloring non-uniform hypergraphs.
  Linyuan Lu*, University of South Carolina
  (1022-05-98)
- 9:00 a.m.
  Graph representations: measured intersections.
  Zoltan Furedi*, University of Illinois at Urbana-Champaign
  (1022-05-153)
- 9:30 a.m.
  Reconstructing graphs with small number of sizes on induced subgraphs.
  Maria Axenovich*, Iowa State University
  Jozsef Balogh, University of Illinois at Urbana Champaign
  (1022-05-99)
- 10:00 a.m.
  Graphs Containing Hamiltonian Cycles with Uniformly Distributed Vertices and Edges.
  Ralph Faudree*, University of Memphis
  Ron Gould, Emory University
  Michael Jacobson, University of Colorado at Denver
  Colton Magnant, Emory University
  (1022-05-112)
- 10:30 a.m.
  A spectral approach to classical extremal graph theory.
  Vladimir Nikiforov*, University of Memphis, Memphis, TN
  (1022-05-129)

Saturday November 4, 2006, 1:30 p.m.-4:20 p.m.
Special Session on Extremal and Probabilistic Combinatorics, III
Room 402, Science and Engineering Building
Organizers:
Jerrold R. Griggs, University of South Carolina griggs@math.sc.edu
Joshua N. Cooper, University of South Carolina cooper@math.sc.edu
- 1:30 p.m.
  Equitable colorings of sparse graphs.
  H. A. Kierstead, Arizona State University
  A. V. Kostochka*, University of Illinois at Urbana-champaign
  (1022-05-44)
- 2:00 p.m.
  The Rank of Random Graphs.
  Kevin P Costello*, Ruitgers University
  Van H Vu, Rutgers University
  (1022-05-136)
- 2:30 p.m.
  The diameter game.
  Ryan R. Martin*, Iowa State University
  Jozsef Balogh, University of Illinois at Urbana-Champaign
  Andr\'as Pluhar, University of Szeged
  (1022-05-92)
- 3:00 p.m.
  Pair dominating graphs.
  Paul N Balister*, University of Memphis
  Bela Bollobas, University of Memphis
  (1022-05-150)
- 3:30 p.m.
  On the number of complete bipartite subgraphs of a graph.
  Jonathan Cutler*, University of Nebraska-Lincoln
  Jamie Radcliffe, University of Nebraska-Lincoln
  (1022-05-97)
- 4:00 p.m.
  Problems in Combinatorics.
  Sebastian Cioaba*, UCSD
  (1022-05-155)

Inquiries: meet@ams.org