Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs

Link:
Autor/in:
Erscheinungsjahr:
2020
Medientyp:
Text
Schlagworte:
  • Dirac’s theorem
  • Hamiltonian cycle
  • hypergraph
Beschreibung:
  • We show that every 4-uniform hypergraph with n vertices and minimum pair degree at least (5/9+o(1))n2/2 contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.
Lizenz:
  • info:eu-repo/semantics/closedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/4cb5ef56-a90c-4a1d-a841-2c359c725ef6