科研之友
微信
新浪微博
Facebook
分享链接
摘要
Using the linear algebra method Huang and Zhao proved that if n > 2k and F is an intersecting n-vertex k-uniform hypergraph with minimum degree at least (sic), then F is the star. In this note we present an elementary, combinatorial proof of this result for the case n >= 3k. We also prove a vector space version of the Huang-Zhao result along the same line as their proof.
- 出版日期2017-5
