Monday, June 12

Extremal Problems

3:30 pm - 6:00 pm
Room: Section C
Chair: Prasad Tetali, Georgia Institute of Technology, USA

3:30 - 3:45 Two-Coloring Random Hypergraphs
Dimitris Achlioptas and Jeong Han Kim, Microsoft Research, USA; Michael Krivelevich, Tel Aviv University, Israel; and Prasad Tetali, Georgia Institute of Technology, USA
3:50 - 4:05 Extremal Setsystems With Even Multi-Intersections--A Generalization of a Theorem of Berlekamp
Van H. Vu, Microsoft Research, USA
4:10 - 4:25 The Quest for Triangle-Free Four-Colorings of K_n
Stanislaw P. Radziszowski, Rochester Institute of Technology, USA
4:30 - 4:45 Estimating the Maximum
Ben Gum, Richard Lipton, and Andrea LaPaugh, Princeton University, USA; and Faith Fich, University of Toronto, Canada
4:50 - 5:05 Shadows and Isoperimetry in Bipartite Graphs
Sergei L. Bezrukov and Victor P. Piotrowski, University of Wisconsin-Superior, USA
5:10 - 5:25 Covering Non-Uniform Hypergraphs with Applications to Multiple F-Copies in Graphs
Endre Boros, RUTCOR, Rutgers University, USA; Yair Caro, University of Haifa-ORANIM, Israel; Zoltán Füredi, Mathematical Institute of the Hungarian Academy of Sciences, Hungary; and Raphael Yuster, University of Haifa - ORANIM, Israel

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 3/16/00