Loose Hamiltonian cycles forced by (k ? 2)-degree ? approximate version

Link:
Autor/in:
Erscheinungsjahr:
2016
Medientyp:
Text
Schlagworte:
  • Uniform hypergraph
  • Hypergraph
  • Minimum codegree
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Hamiltonian cycles
  • hypergraphs
  • degree conditions
  • Uniform hypergraph
  • Hypergraph
  • Minimum codegree
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • We prove that for all k≥3 and 1≤ℓ
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/7fabf241-6565-41fc-93fa-ace7f7039a33