Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Link:
Autor/in:
Erscheinungsjahr:
2011
Medientyp:
Text
Schlagworte:
  • Uniform hypergraph
  • Hypergraph
  • Minimum codegree
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Uniform hypergraph
  • Hypergraph
  • Minimum codegree
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ1(H)≥(7/16+o(1))(n2) contains a loose Hamilton cycle. This bound is asymptotically best possible. © 2011 Elsevier B.V.
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/9d9eb773-e342-48cc-a17e-47e1323be874