AMS Sectional Meeting Program by Special Session

Current as of Saturday, April 28, 2007 00:31:19

2007 Spring Western Section Meeting
Tucson, AZ, April 21-22, 2007 (Saturday - Sunday)
Meeting #1027

• Saturday April 21, 2007, 8:30 a.m.-10:50 a.m.
  Special Session on Graph Theory and Combinatorics, I
  Room 304, Modern Languages
  Organizers:
  Sebastian M. Cioaba, University of California at San Diego scioaba@math.ucsd.edu
  Joshua Cooper, University of South Carolina cooper@math.sc.edu
  

  • 8:30 a.m.
    Perfect matchings in regular graphs from eigenvalues.
    Sebastian M Cioab\u{a}*, University of California at San Diego
    David A Gregory, Queen's University
    Willem Haemers, Tilburg University
    (1027-05-83)
  • 9:00 a.m.
    Set systems without a simplex or a cluster.
    Peter Keevash*, Caltech
    Dhruv Mubayi, University of Illinois, Chicago
    (1027-05-94)
  • 9:30 a.m.
    Realizing Degree Sequences with Graphs having Nowhere-zero 3-Flows.
    Rong Luo, Middle Tennessee State University
    Rui Xu*, University of West Georgia
    Wenan Zang, University of Hong Kong
    Cun-Quan Zhang, West Virginia University
    (1027-05-51)
  • 10:00 a.m.
    New Models and Questions in Geometric Random Graphs.
    Ross M. Richardson*, University of California, San Diego
    (1027-05-20)
  • 10:30 a.m.
    Gallai Multigraphs.
    Kyle Pula*, University of Denver
    (1027-05-08)
• Saturday April 21, 2007, 3:00 p.m.-5:20 p.m.
  Special Session on Graph Theory and Combinatorics, II
  Room 304, Modern Languages
  Organizers:
  Sebastian M. Cioaba, University of California at San Diego scioaba@math.ucsd.edu
  Joshua Cooper, University of South Carolina cooper@math.sc.edu
  

  • 3:00 p.m.
    Erd{\H o}s-Ko-Rado Theorems for Permutations and Set Partitions.
    Cheng Yeaw Ku*, California Institute of Technology
    David Renshaw, California Institute of Technology
    (1027-05-121)
  • 3:30 p.m.
    Induced universal graphs for graphs with bounded maximum degree.
    Steve Butler*, University of California, San Diego
    (1027-05-25)
  • 4:00 p.m.
    Upper bounds on the independence number for weighted matrices of graphs.
    Randall J Elzinga*, Queen's University at Kingston
    (1027-05-235)
  • 4:30 p.m.
    Monomial Graphs of Girth at Least Eight.
    Vasyl Dmytrenko, Temple University
    Felix Lazebnik, University of Delaware
    Jason Williford*, Worcester Polytechnic Institute
    (1027-05-217)
  • 5:00 p.m.
    Equitable Coloring.
    H. A. Kierstead*, Arizona State University
    A. V. Kostochka, University of Illinois, Urbana
    (1027-05-62)
• Sunday April 22, 2007, 8:30 a.m.-10:50 a.m.
  Special Session on Graph Theory and Combinatorics, III
  Room 304, Modern Languages
  Organizers:
  Sebastian M. Cioaba, University of California at San Diego scioaba@math.ucsd.edu
  Joshua Cooper, University of South Carolina cooper@math.sc.edu
  

  • 8:30 a.m.
    Constrained coloring problems for planar graphs.
    Andr\'e K\"undgen*, Cal State San Marcos
    (1027-05-202)
  • 9:00 a.m.
    The spectral gap of a random subgraph of a graph.
    Fan Chung, UCSD
    Paul K Horn*, UCSD
    (1027-05-204)
  • 9:30 a.m.
    Distributed algorithms and graph theory.
    Andrzej Czygrinow*, Department of Mathematics and Statistics, Arizona State University
    (1027-05-169)
  • 10:00 a.m.
    Spectral supersaturation in graphs.
    Vladimir Nikiforov*, University of Memphis, Tennessee, USA
    (1027-05-198)
  • 10:30 a.m.
    Survey of Bulgarian Solitaire.
    Brian Hopkins*, Saint Peter's College
    (1027-05-16)