Erdős Problem #1024 — Independent sets in linear triple systems

Let $f(n)$ be the minimum, over all $3$-uniform hypergraphs on $n$ vertices in which any two edges intersect in at most one vertex, of the maximum size of a vertex set containing no edge. Determine the order of growth of $f(n)$.