Hamilton cycles in line graphs of 3-hypergraphs

From MaRDI portal
Publication:2144607




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.









This page was built for publication: Hamilton cycles in line graphs of 3-hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144607)