Finding tight Hamilton cycles in random hypergraphs faster

In an r-uniform hypergraph on n vertices, a tight Hamilton cycle consists of n edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of r vertices. We provide a first deterministic polynomial-time algorithm, which finds a.a.s. tight Hamilto...

Full description

Bibliographic Details

Published in:	Combinatorics, probability & computing Vol. 30; no. 2; pp. 239 - 257
Main Authors:	Allen, Peter, Koch, Christoph, Parczyk, Olaf, Person, Yury
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.03.2021
Subjects:	Algorithms Apexes Graph theory Graphs Polynomials 05C65 05C85 05C80
ISSN:	0963-5483, 1469-2163
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!