报告题目： Nearly perfect matchings in hypergraphs

报告人：袁晓璠（School of Mathematics，Georgia Institute of Technology）

时间：12月24日（周一）下午 16:00-17:00

地点：1318

摘要： 

The problem for finding a maximum matching in a hypergraph is NP-hard, even for 3-partite 3-graphs. There has been extensive study on sufficient condisions for the existence of a large matching in a uniform hypergraph. In this talk, I will discuss minimum l-degree conditions for the existence of nearly perfect matchings. In certain situations, these conditions in fact are sufficient for the existence of a near perfect matching. Our results generalize and/or improve some previous results. This is joint work with Hongliang Lu and Xingxing Yu.