Let $f_k(n)$ denote the smallest integer such that any $f_k(n)$ points in general position in ${\mathbb{R}}^k$ contain $n$ which determine a convex polyhedron. Is it true that$$f_k(n)>(1+c_k{)}^n$$for some constant $c_k>0$?