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)$ .

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved