American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:10:30


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

2003 Spring Central Section Meeting
Bloomington, IN, April 4-6, 2003
Meeting #985

Associate secretaries:
Susan J Friedlander, AMS susan@math.northwestern.edu

Special Session on Extremal Combinatorics

  • Friday April 4, 2003, 2:00 p.m.-5:20 p.m.
    Special Session on Extremal Combinatorics, I

    Room 204, Ballantine Hall
    Organizers:
    Dhruv Mubayi, University of Illinois at Chicago mubayi@math.uic.edu
    Jozef Skokan, University of Illinois at Urbana-Champaign jozef@math.uiuc.edu

    • 2:00 p.m.
      Lower bound on the profile of degree pairs in cross-intersecting systems.
      Zsuzsanna Szaniszlo*, Valparaiso University
      Zsolt Tuza, Computer and Automation Institute, Hungarian Acade
      (985-05-27)
    • 2:30 p.m.
      Searching for Dense Graphs without 8-cycles.
      Vasyl Dmytrenko*, University of Delaware
      Felix Lazebnik, University of Delaware
      (985-05-213)
    • 3:00 p.m.
      Strong Colouring.
      P E Haxell*, University of Waterloo
      (985-05-282)
    • 3:30 p.m.
      On incomparable and uncomplemented families of finite sets.
      Yuejian Peng*, Indiana State University
      Cheng Zhao, Indiana State University
      (985-05-334)
    • 4:00 p.m.
      On the chromatic number of intersection graphs of convex sets in the plane.
      Seog-Jin Kim*, University of Illinois at Urbana-Champaign
      Alexandr Kostochka, University of Illinois at Urbana-Champaign
      Kittikorn Nakprasit, University of Illinois at Urbana-Champaign
      (985-05-165)
    • 4:30 p.m.
      Polychromatic cliques and related questions.
      Ryan R. Martin*, Carnegie Mellon University
      Tom Bohman, Carnegie Mellon University
      Alan Frieze, Carnegie Mellon University
      Miklos Ruszinko, Computer and Automation Research Institute, Hungarian Academy of Sciences
      Cliff Smyth, Carnegie Mellon University
      (985-05-269)
    • 5:00 p.m.
      On Hypergraphs of Girth Five.
      Felix Lazebnik*, Department of Mathematical Sciences, University of Delaware
      Jacques Verstra\" ete, Theory Group, Microsoft Research
      (985-05-223)
  • Saturday April 5, 2003, 8:30 a.m.-11:20 a.m.
    Special Session on Extremal Combinatorics, II

    Room 208, Ballantine Hall
    Organizers:
    Dhruv Mubayi, University of Illinois at Chicago mubayi@math.uic.edu
    Jozef Skokan, University of Illinois at Urbana-Champaign jozef@math.uiuc.edu

    • 8:30 a.m.
      Bounds on the Turan density of PG(3,2).
      M Cioaba Sebastian*, Queen's Universiy
      (985-05-51)
    • 9:00 a.m.
      On the number of edges in uniform hypergraphs with no even cycles.
      Alexandr Kostochka*, University of Illinois
      Jacques Verstraete, Microsoft Research
      (985-05-63)
    • 9:30 a.m.
      Essentially infinite colourings of hypergraphs.
      B\'ela Bollob\'as, The University of Memphis and Trinity College, Cambridge
      Yoshiharu Kohayakawa*, Universidade de S\~ao Paulo and Emory University
      Vojt\v ech R\"odl, Emory University
      Anusch Taraz, Humboldt-Universit\"at zu Berlin
      (985-05-305)
    • 10:00 a.m.
      An optimal algorithm for checking regularity.
      Y. Kohayakawa, University of Sao Paulo
      V. Rodl, Emory University
      L. Thoma*, University of Rhode Island
      (985-05-289)
    • 10:30 a.m.
      A Construction of Extremal Graphs Using Finite Geometry.
      Keith E Mellinger*, University of Illinois at Chicago
      Dhruv Mubayi, University of Illinois at Chicago
      (985-05-60)
    • 11:00 a.m.
      Coloring with no 2-colored $P_4$'s.
      Radhika Ramamurthi*, California State University San Marcos
      Michael Albertson, Smith College
      Glenn Chappell, University of Alaska Fairbanks
      H.A. Kierstead, Arizona State University
      Andre Kundgen, California State University San Marcos
      (985-05-329)
  • Saturday April 5, 2003, 3:00 p.m.-4:50 p.m.
    Special Session on Extremal Combinatorics, III

    Room 208, Ballantine Hall
    Organizers:
    Dhruv Mubayi, University of Illinois at Chicago mubayi@math.uic.edu
    Jozef Skokan, University of Illinois at Urbana-Champaign jozef@math.uiuc.edu

    • 3:00 p.m.
      The number of edge colorings with no monochromatic cliques.
      Noga Alon, IAS, Princeton
      Jozsef Balogh*, Ohio State University
      Peter Keevash, Princeton
      Benny Sudakov, Princeton
      (985-05-229)
    • 3:30 p.m.
      Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice.
      Jerrold R. Griggs*, University of South Carolina
      Charles E Killian, North Carolina State University
      Carla D Savage, North Carolina State University
      (985-05-195)
    • 4:00 p.m.
      A bound on the sum of squares of degrees in a monotone graph family.
      Zoltan Furedi, University of Illinois, Urbana-Champaign and Renyi Institute, Budapest
      Andre Kundgen*, Cal State San Marcos
      (985-05-327)
    • 4:30 p.m.
      On Randomly Generated Intersecting Hypergraphs.
      Tom Bohman, Carnegie Mellon University
      Colin Cooper, Carnegie Mellon University
      Alan Frieze, Carnegie Mellon University
      Ryan Martin, Carnegie Mellon University
      Miklos Ruszinko*, Carnegie Mellon University
      (985-05-337)
  • Sunday April 6, 2003, 9:00 a.m.-12:20 p.m.
    Special Session on Extremal Combinatorics, IV

    Room 208, Ballantine Hall
    Organizers:
    Dhruv Mubayi, University of Illinois at Chicago mubayi@math.uic.edu
    Jozef Skokan, University of Illinois at Urbana-Champaign jozef@math.uiuc.edu

    • 9:00 a.m.
      An Improved Extremal Function for Graph Linkages.
      Robin Thomas, Georgia Inst. of Tech.
      Paul Wollan*, Georgia Inst. of Tech.
      (985-05-260)
    • 9:30 a.m.
      A hypercube covering problem, or DNF with exceptions.
      Dhruv Mubayi, Univ. of Illinois at Chicago
      Gyorgy Turan*, Univ. of Illinois at Chicago
      Yi Zhao, Univ. of Illinois at Chicago
      (985-05-241)
    • 10:00 a.m.
      Nontrivial Intersecting Families.
      Jacques Alain Verstraete*, Microsoft Research
      Dhruv Mubayi, University of Illinois, Chicago
      (985-05-339)
    • 10:30 a.m.
      Tree representations of $K_{n,n}$.
      Nancy Eaton*, University of Rhode Island
      Zoltan Furedi, University of Illinois at Urbana-Champaign
      Alexandr V. Kostochka, University of Illinois Urbana-Champaign
      Jozef Skokan, University of Illinois at Urbana-Champaign
      (985-05-274)
    • 11:00 a.m.
      A New Degree Condition For Graph Tiling.
      Ali Shokoufandeh, Drexel University
      Yi Zhao*, University of Illinois at Chicago
      (985-05-177)
    • 11:30 a.m.
      \documentclass{article} \title{Embedding graphs with bounded degree in pseudorandom sparse graphs} \begin{document}\date{\empty}\maketitle\end{document}.
      Yoshiharu Kohayakawa, University of Sao Paulo
      Vojtech Rodl, Emory University
      Papa Amar Sissokho*, Emory University
      (985-05-333)
    • 12:00 p.m.
      An extremal function for $K_9$ minors.
      Zixia Song*, School of Mathematics, Georgia Institute of Technology
      Robin Thomas, School Of Mathematics, Georgia Institute of Technology
      (985-05-227)
Inquiries:  meet@ams.org