Dirac-Type Conditions for Spanning Bounded-Degree Hypertrees
Abstrakt
We prove that for fixed k, every k-uniform hypergraph on n vertices and of minimum codegree at least n/2 + o(n) contains every spanning tight k-tree of bounded vertex degree as a subgraph. This generalises a well-known result of Komlós, Sárközy and Szemerédi for graphs. Our result is asymptotically sharp.