Prefer a chat interface with context about you and your work?
Packing Loose Hamilton Cycles
A subset C of edges in a k -uniform hypergraph H is a loose Hamilton cycle if C covers all the vertices of H and there exists a cyclic ordering of these vertices such that the edges in C are segments of that order and such that every two consecutive …