We prove a minimum degree version of the Kruskal-Katona theorem for
triple systems. Given $d> 1/4$ and a triple system on $n$ vertices with minimum
degree $d\binom{n}{2}$, we obtain asymptotically tight lower bounds for the
size of its shadow. Many problems remain unsolved.
A joint work with Yi Zhao (Georgia State University).