SEMINARS
Matching in 3-uniform hypergraphs

2017-07-05　09:30 — 10:30

Middle Lecture Room

A \$3\$-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}{3}\$ is a family of \$3\$-element subsets of \$V\$. A matching of a \$3\$-uniform hypergraph is a set of pairwise disjoint edges. A \$d\$-matching in a \$3\$-uniform hypergraph \$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 \$3\$-uniform hypergraphs.
The work was joint with Yi Zhang.