An Ore-type theorem for $[3]$-graphs

Yupei Li, Linyuan Lu, Ruth Luo

Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian. A $[3]$-graph is a hypergraph…