skip to content
 

Existence of a perfect matching in a random (1 + 1/e)-out bipartite graph

Presented by: 
M Karonski [Adam Mickiwicz University, Poznan]
Date: 
Thursday 15th August 2002 - 10:00 to 11:00
Venue: 
INI Seminar Room 1
Session Title: 
Randomised Algorithms
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons