Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs Link: https://doi.org/10.1112/plms.12235 Autor/in: Reiher, Christian Rödl, Vojtech Rucinski, Andrzej Schacht, Mathias Szemeredi, Endre Erscheinungsjahr: 2019 Medientyp: Text Schlagworte: 05C65 (primary)05C4505D05 (secondary) Beschreibung: We show that every 3-uniform hypergraph with n vertices and minimum vertex degree at least (5/9 + o(1)) (n 2) contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal. Lizenz: info:eu-repo/semantics/restrictedAccess Quellsystem: Forschungsinformationssystem der UHH Interne Metadaten Quelldatensatz oai:www.edit.fis.uni-hamburg.de:publications/a1f63a15-27c2-4281-bffd-01e80601b7e4