Prefer a chat interface with context about you and your work?
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs
The study of asymptotic minimum degree thresholds that force matchings and tilings in hypergraphs is a lively area of research in combinatorics. A key breakthrough in this area was a result of Hàn, Person, and Schacht [SIAM J. Disc. Math., 23 (2009), pp. 732--748] who proved that the asymptotic minimum …