Finding perfect matchings in \(k\)-uniform hypergraphs has been a central topic in extremal hypergraph theory in the past decade. When \(k\) is at least 3, the problem appears to be much harder than its graph case (\(k=2\)), e.g., determining if a general 3-uniform hypergraph has a perfect matching is one of the 21 NP-complete problems of Karp. In this talk I will present some results on the degree-type conditions that force perfect matchings.
Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.
The ACO Seminar (2019–2020)