Aditya Potukuchi, Rutgers University

Abstract

We will study the quite well known threshold for perfect matchings in G_{n,p}, and (hopefully) hypergraphs. Due to the relatively lengthy nature of these proofs, I will try to confine myself mostly to 'sketches' of (only) most parts the proof(s).