Improved Bound on Vertex Degree Version of Erdős Matching Conjecture

Mingyang Guo, Hongliang Lu, Yaolin Jiang

For a $k$-uniform hypergraph $H$, let ${\delta }_1(H)$ denote the minimum vertex degree of $H$, and $\nu (H)$ denote the size of the largest matching in $H$. In this paper, we show that for a…