2 problems

The family-level tower lower-bound conjecture. If $k>s$, then there exists a positive constant $c$ such that

The tower lower-bound conjecture. If $k>s$ and $H$ is an $s$-tightly connected $k$-graph that is not $k$-partite, then there exists a positive constant $c$ such that