Degree versions of the Erdos-Ko-Rado Theorem and Erdos hypergraph   matching conjecture
  We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges. This result can be viewed as a special case of the degree version of a well-known conjecture of Erd\H{o}s on hypergraph matchings. Improving the work of Bollob\'as, Daykin, and Erd\H os from 1976, we show that given integers $n, k, s$ with $n\ge 3k^2 s$, every $k$-uniform hypergraph $H$ on $n$ vertices with minimum vertex degree greater than $\binom{n-1}{k-1}-\binom{n-s}{k-1}$ contains $s$ disjoint edges. 
Hao Huang, Yi Zhao
math.CO