报 告 人:陆玫 教授(清华大学)
报告题目:Vertex degree sums for s-matchings in 3-uniform hypergraphs
报告时间:2018年1月25日(周四)上午11:00
报告地点:静远楼204报告厅
报告摘要:
Let H be a 3-uniform hypergraph of order n. A matching of size s in H is a family of s pairwise disjoint edges of H. We showed if d(u)+d(v)>2(s-1)(n-1) for any two adjacent vertices u and v of H, then H contains a matching of size s.