What is the largest possible minimal 3CNF formula as function of the number of variables?
Chungboom Lee, On the size of minimal unsatisfiable formulas shows that when $k=2$, the answer is $\Theta(n)$, and when $k \geq 3$, the answer is $\Theta(n^k)$. Here $k$ is width of the clauses.