# 兰州大学110周年校庆系列活动之“九章讲坛”第168讲——陆玫教授

A \$k\$-uniform hypergraph is a pair \$H = (V,E)\$,where \$V: = V(H)\$ is a finite set of vertices and \$E = E(H)\subseteq\binom{V}{k}\$ is a family of \$k\$-element subsets of \$V\$.A matching of a \$k\$-uniform hypregraph is a set of pairwise disjoint edges.A \$d\$-matching in a \$k\$-uniform hypregraph \$H\$ is a matching of size \$d\$.In this talk,we will provide some necessary and sufficient conditions for the existence of \$d\$-matching in \$k\$-uniform hypergraphs.The work was joint with YiZhang.

2019年9月23日

0