Space complexity of random formulae in resolution

We study the space complexity of refuting unsatisfiable random k-CNFs in the resolution proof system. We prove that for any large enough Δ, with high probability a random k-CNF over n variables and Δn clauses requires resolution clause space of Ω(n·Δ^-1+εk-2-ε/), for any 0<ε<1/2. For constant Δ, this gives us linear, optimal, lower bounds on the clause space. A nice consequence of this lower bound is the first lower bound for size of tree-like resolution refutations of random 3-CNFs with clause density Δ>>√n. This bound is nearly tight. Specifically, we show that with high probability, a random 3-CNF with Δn clauses requires tree-like refutation size of exp(Ω(n/Δ^1+ε/1-ε)), for any 0<ε<1/2. Our space lower bound is the consequence of three main contributions. 1. We introduce a 2-player matching game on bipartite graphs G to prove that there are no perfect matchings in G. 2. We reduce lower bounds for the clause space of a formula F in resolution to lower bounds for the complexity of the game played on the bipartite graph G(F) associated with F. 3. We prove that the complexity of the game is large whenever G is an expander graph. Finally, a simple probabilistic analysis shows that for a random formula F, with high probability G(F) is an expander. We also extend our result to the case of G-PHP, a generalization of the pigeonhole principle based on bipartite graphs G. We prove that the clause space for G-PHP can be reduced to the game complexity on G