A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity

In [Graphs Combin. 24 (2008) 469–483], the third author and the fifth author conjectured that if $G$ is a $k$-connected graph such that $\sigma_{k+1}(G) \ge |V(G)|+\kappa(G)+(k-2)(\alpha(G)-1)$, then $G$ contains a Hamilton cycle, where $\sigma_{k+1}(G)$, $\kappa(G)$ and $\alpha(G)$ are the minimum degree sum of $k+1$ independent vertices, the connectivity and the independence number of $G$, respectively. In this paper, we settle this conjecture. The degree sum condition is best possible.

Vertex Degree Sums for Matchings in 3-Uniform Hypergraphs

Let $n, s$ be positive integers such that $n$ is sufficiently large and $s\le n/3$. Suppose $H$ is a 3-uniform hypergraph of order $n$ without isolated vertices. If $\deg(u)+\deg(v) > 2(s-1)(n-1)$ for any two vertices $u$ and $v$ that are contained in some edge of $H$, then $H$ contains a matching of size $s$. This degree sum condition is best possible and confirms a conjecture of the authors [Electron. J. Combin. 25 (3), 2018], who proved the case when $s= n/3$.