MATH Seminar

Title: Exact Minimum Degree Thresholds for Perfect Matchings in Uniform Hypergraphs
Seminar: Combinatorics
Speaker: Yi Zhao of Georgia State University
Contact: Dwight Duffus, dwight@mathcs.emory.edu
Date: 2012-10-26 at 4:00PM
Venue: MSC W303
Download Flyer
Abstract: Given positive integers $k$ and $d$ where $k/2 \leq d \leq k-1$, we give a minimum $d$-degree condition that ensures a perfect matching in a $k$-uniform hypergraph. This condition is best possible and extends the work of Pikhurko, Rödl, Ruci\'{n}ski and Szemerédi. Our approach makes use of the absorbing method. This is a joint work with Andrew Treglown.