Loose Hamilton paths in the 3-uniform cube hypergraph
Oliver Cooley, Johannes Machata, Matija Pasch

TL;DR
This paper investigates the existence of loose Hamilton paths in the 3-uniform cube hypergraph, a hypergraph analogue of the hypercube, and identifies the dimensions in which such paths exist, given the impossibility of Hamilton cycles.
Contribution
It determines the dimensions where loose Hamilton paths exist in the 3-uniform cube hypergraph, extending understanding of Hamiltonian properties in hypergraph analogues of hypercubes.
Findings
Loose Hamilton paths exist in certain dimensions of the 3-uniform cube hypergraph.
The 3-uniform cube hypergraph cannot have a loose Hamilton cycle in any dimension.
The paper characterizes the dimensions supporting loose Hamilton paths.
Abstract
It is well-known that the -dimensional hypercube contains a Hamilton cycle for . In this paper we address the analogous problem in the -uniform cube hypergraph, a -uniform analogue of the hypercube: for simple parity reasons, the -uniform cube hypergraph can never admit a loose Hamilton cycle in any dimension, so we do the next best thing and consider loose Hamilton paths, and determine for which dimensions these exist.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Advanced Graph Theory Research
