Journal of University of Science and Technology of China ›› 2020, Vol. 50 ›› Issue (5): 669-672.DOI: 10.3969/j.issn.0253-2778.2020.05.014

• Original Paper • Previous Articles     Next Articles

Ore-type condition for loose Hamilton cycles in 3-uniform hypergraphs

  

  1. YU Lei
  • Received:2019-06-08 Revised:2019-10-15 Accepted:2019-10-15 Online:2020-05-31 Published:2019-10-15
  • About author:YU Lei, male, born in 1990,PhD.Research field: Geometry and analysis.

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.

Key words: Ore-type condition, hypergraph, Hamilton cycle, degree

CLC Number: