Let $f(n)$ be such that every $3$-uniform linear hypergraph on $n$ vertices contains an independent set on $f(n)$ vertices. Estimate $f(n)$.

unreviewedOpen. Worked here; no verified result yet.

graph theory · solved · possible · 0 attempts