DIMACS - Graduate Student Combinatorics Seminar

Title: Threshold(s) for Perfect Matchings in Graphs

Speaker: Aditya Potukuchi, Rutgers University

Date: Wednesday, April 19, 2017 12:10pm

Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ


We will study the quite well known theshold 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).

See: http://www.math.rutgers.edu/~ajr224/GCS.html