Nearly perfect matchings in regular simple hypergraphs
Nearly perfect matchings in regular simple hypergraphs
Random perfect matchings in regular graphs - NASA/ADS
... uniformly chosen matching. Our proofs rely on the switching method and the fact that simple random walks mix rapidly in robust expanders.