Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths

Abstract

For α > 0 and large integer n, let H be an n-vertex 3uniform hypergraph such that every pair of vertices isedges. We show that H contains two vertex-disjoint tight paths whose union covers the vertex set of H . The quantity two here is best possible and the degree condition is asymptotically best possible. This result also has an interpretation as the deficiency problems, recently introduced by Nenadov, Sudakov, and Wagner: every such H can be made Hamiltonian by adding at most two vertices and all triples intersecting them.