English

Loose Hamilton paths in the 3-uniform cube hypergraph

Combinatorics 2024-09-16 v2

Abstract

It is well-known that the dd-dimensional hypercube contains a Hamilton cycle for d2d\ge 2. In this paper we address the analogous problem in the 33-uniform cube hypergraph, a 33-uniform analogue of the hypercube: for simple parity reasons, the 33-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.

Cite

@article{arxiv.2406.00401,
  title  = {Loose Hamilton paths in the 3-uniform cube hypergraph},
  author = {Oliver Cooley and Johannes Machata and Matija Pasch},
  journal= {arXiv preprint arXiv:2406.00401},
  year   = {2024}
}

Comments

First version is Bachelor's Thesis, 2nd version is paper

R2 v1 2026-06-28T16:49:32.290Z