On the structure and the number of prime implicants of 2-CNFs

Let m(n,k)m(n,k) be the maximum number of prime implicants that any kk-CNF on nn variables can have. We show that 3n3≤m(n,2)≤(1+o(1))3n3.