Skip to Main Content

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:08:42

Program  |  Deadlines  |  Inquiries:

1990 Central Section Meeting
Manhattan, KS, March 16-17, 1990
Meeting #855

Associate secretaries:
Andy R Magid, AMS

Special Session on Graph Theory

  • Friday March 16, 1990, 8:00 a.m.-9:50 a.m.
    Special Session on Graph Theory, I

    Room 146, Cardwell Hall

    • 8:00 a.m.
      Coloring tournaments.
      Kunwarjit S. Bagga, Ball State University
      Lowell W. Beineke*, Indiana University-Purdue University, Ft.\ Wayne
      Frank Harary, New Mexico State University, Las Cruces
    • 8:30 a.m.
      A combinatorial approach to the integral multicommodity flow problem with application to the packed routing.
      F. Shahrokhi, North Texas University
      L. A. Sz\'ekely*, University of New Mexico
    • 9:00 a.m.
      k-graphs with uniformly distributed subgraphs.
      F. R. K. Chung, Bell Communications Research, Morristown, NJ
      R. L. Graham*, AT&T Bell Laboratories, Murray Hill, New Jersey
    • 9:30 a.m.
      Quasi-random classes of hypergraphs.
      Fan R. K. Chung*, Bellcore, Morristown, New Jersey
  • Friday March 16, 1990, 2:00 p.m.-4:20 p.m.
    Special Session on Graph Theory, II

    Room 146, Cardwell Hall

    • 2:00 p.m.
      Unavoidable subgraphs of sparse graphs: Lagniappe.
      C. A. Barefoot, University of New Mexico
      L. H. Clark, University of New Mexico
      R. C. Entringer*, University of New Mexico
      A. A. Kooshesh, University of New Mexico
      L. A. Sz\'ekely, University of New Mexico
    • 2:30 p.m.
      Homomorphisms with the lifting property.
      Bennet Manvel*, Colorado State University
      Richard Osborne, Colorado State University
    • 3:00 p.m.
      A prime number theorem for normed graphs.
      Robin J. Wilson*, Open University, England
    • 3:30 p.m.
      Size and independence in triangle-free graphs with fixed maximum degree.
      Kathryn F. Jones*, University of Colorado
    • 4:00 p.m.
      An upper bound for the average number of regions.
      Saul Stahl*, University of Kansas
  • Saturday March 17, 1990, 7:00 a.m.-9:50 a.m.
    Special Session on Graph Theory, III

    Room 146, Cardwell Hall

    • 7:00 a.m.
      Edge-graceful cubic graphs.
      John Watkins*, Colorado College
    • 7:30 a.m.
      Ramsey problems and their relation to Turan type extremal problems.
      R. J. Faudree*, Memphis State University
      M. Simonovits, Hungarian Academy of Sciences, Hungary
    • 8:00 a.m.
      On peripheral vertices in graphs.
      Gary Chartrand*, Western Michigan University
      Garry Johns, Saginaw Valley State University
      Ortrud R. Oellermann, University of Natal, South Africa
    • 8:30 a.m.
      Some unconventional games on graphs.
      Paul Erd\"os*, Hungarian Academy of Sciences, Hungary
    • 9:00 a.m.
      Minimum Boolean factorization of tournament codes.
      Greg Bain, University of Colorado, Denver
      J. Richard Lundgren*, University of Colorado, Denver
      John S. Maybee, University of Colorado, Boulder
    • 9:30 a.m.
      The dimension of a random partial order of height one.
      W. T. Trotter*, Arizona State University
      H. Kierstead, Arizona State University
      P. Erd\"os, Hungarian Academy of Sciences, Hungary