Ore-type condition for loose Hamilton cycles in 3-uniform hypergraphs
-
Abstract
A classic result of Ore in 1960 states that if the degree sum of any two independent vertices in an n-vertex graph is at least n, then the graph is Hamiltonian. Here a similar problem for 3-uniform hypergraph was studied and an approximate result was obtained.
-
-