×

Ore-type condition for loose Hamilton cycles in 3-uniform hypergraphs. (English) Zbl 1488.05287

Summary: A classic result about graphs was proved in 1960 that if the degree sum of any two independent vertices in an \(n\)-vertex graph is at least \(n\), then the graph is Hamiltonian. In this paper, a similar problem for 3-uniform hypergraph was studied and an approximate result was obtained.

MSC:

05C45 Eulerian and Hamiltonian graphs
05C38 Paths and cycles
05C65 Hypergraphs
PDFBibTeX XMLCite