欢迎光临!
您现在所在的位置:首页 >> 通知公告 & 学术信息
学术信息
SEMINARS
Matching in 3-uniform hypergraphs
时间  Datetime
2017-07-05 09:30 — 10:30 
地点  Venue
Middle Lecture Room
报告人  Speaker
陆玫教授
单位  Affiliation
清华大学
邀请人  Host
张晓东
报告摘要  Abstract

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.