Squares of Hamiltonian cycles in 3-uniform hypergraphs

Link:
Autor/in:
Erscheinungsjahr:
2020
Medientyp:
Text
Schlagworte:
  • hypergraphs
  • Hamiltonian cycles
  • Posa's conjecture
Beschreibung:
  • We show that every 3‐uniform hypergraph H = (V,E) with |V(H)| = n and minimum pair degree at least (4/5 + o(1))n contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the Pósa‐Seymour conjecture.
Lizenz:
  • info:eu-repo/semantics/openAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/85a5b65f-3a7c-4582-97fd-2a32f3c4461b