Extremal problems on shadows and hypercuts in simplicial complexes

Nati Linial, Ilan Newman, Yuval Peled +1

Let $F$ be an $n$-vertex forest. We say that an edge $e\notin F$ is in the shadow of $F$ if $F\cup \{e\}$ contains a cycle. It is easy to see that if $F$ is "almost a tree", that is…