3 problems

Illingworth–Lang–Müyesser–Parczyk–Sgueglia's conjecture. If $H$ has minimum codegree at least $n/k$, then $H$ has a spanning tight component.

Let $G$ be a $k$-graph on $n$ vertices, and let $\delta_{k-1}(G)$ denote its minimum $(k-1)$-degree. Minimum-codegree spanning-component conjecture. If … then $G$ contains a spanni…

Loose-cycle factor conjecture. If $n$ is sufficiently large and