Hamilton cycles in line graphs of 3-hypergraphs

Tomáš Kaiser, Petr Vrána

We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.