Using the linear algebra method Huang and Zhao proved that if   n>2k     n  >  2  k        and   F     F        is an intersecting   n     n       -vertex   k     k       -uniform hypergraph with minimum degree at least                n  −  2    k  −  2           , then   F     F        is the star. In this note we present an elementary, combinatorial proof of this result for the case   n≥3k     n  ≥  3  k       . We also prove a vector space version of the Huang–Zhao result along the same line as their proof.
['Peter Frankl', 'Norihide Tokushige']
A note on Huang–Zhao theorem on intersecting families with large minimum degree