On Erdos-Ko-Rado for random hypergraphs

On Erdos-Ko-Rado for random hypergraphs

-
Jeff Kahn , Rutgers University
Fine Hall 224

One of the more interesting of recent combinatorial directions has been the attempt to understand the extent to which various classical facts remain true in a random setting. The present talk will mostly discuss what we know about this question when the ``classical fact" is the Erdos-Ko-Rado Theorem.