Back to Search
Start Over
Hamilton cycles in line graphs of 3-hypergraphs
- Publication Year :
- 2022
-
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.
- Subjects :
- Mathematics - Combinatorics
05C45
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2201.13115
- Document Type :
- Working Paper