2 problems

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…

Let $G$ be a $k$-graph on $n$ vertices. Write $\delta_1(G)$ for its minimum vertex degree, the minimum number of edges containing any one vertex. Spanning-component conjecture. If…