Hamilton cycles in line graphs of 3-hypergraphs
Combinatorics
2022-05-23 v3
Abstract
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.
Keywords
Cite
@article{arxiv.2201.13115,
title = {Hamilton cycles in line graphs of 3-hypergraphs},
author = {Tomáš Kaiser and Petr Vrána},
journal= {arXiv preprint arXiv:2201.13115},
year = {2022}
}