Spanning Components and Surfaces Under Minimum Vertex Degree

Abstract: We study minimum vertex-degree conditions in 3-uniform hypergraphs for (tight) spanning components and (combinatorial) surfaces. Our main results show that a 3-uniform hypergraph $G$ on $n$ vertices contains a spanning component if $δ_1(G) \gtrsim \tfrac{1}{2} \binom{n}{2}$ and a spanning copy of any surface if $δ_1(G) \gtrsim \tfrac{5}{9} \binom{n}{2}$, which in both cases is asymptotically optimal. This extends the work of Georgakopoulos, Haslegrave, Montgomery, and Narayanan who determined the corresponding minimum codegree conditions in this setting.