The complexity of proving that a graph is Ramsey

We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size c log n. We define a CNF formula which expresses this property for a graph G. We show a superpolynomial lower bound on the length of resolution proofs that G is c-Ramsey, for every graph G. Our proof makes use of the fact that every c-Ramsey graph must contain a large subgraph with some properties typical for random graphs.

[1]  Michael Alekhnovich,et al.  Pseudorandom Generators in Propositional Proof Complexity , 2004, SIAM J. Comput..

[2]  Jan Krajícek,et al.  Lower bounds to the size of constant-depth propositional proofs , 1994, Journal of Symbolic Logic.

[3]  Pavel Pudlák.  A lower bound on the size of resolution proofs of the Ramsey theorem , 2012, Inf. Process. Lett..

[4]  Vojtech Rödl,et al.  Non-Ramsey Graphs Are c log n-Universal , 1999, J. Comb. Theory, Ser. A.

[5]  Jan Kraj́ıček,et al.  A note on propositional proof complexity of some Ramsey-type statements , 2011, Arch. Math. Log..

[6]  Jan Krajícek,et al.  Tautologies from Pseudo-Random Generators , 2001, Bulletin of Symbolic Logic.

[7]  Olaf Beyersdorff,et al.  Parameterized Complexity of DPLL Search Procedures , 2013, TOCL.

[8]  Adnan Darwiche,et al.  On the power of clause-learning SAT solvers as resolution engines , 2011, Artif. Intell..

[9]  Alexander A. Razborov,et al.  Parameterized Bounded-Depth Frege Is not Optimal , 2011, TOCT.

[10]  Johannes Klaus Fichte,et al.  Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution , 2011, J. Artif. Intell. Res..

[11]  Pavel Pudlák,et al.  Ramsey's Theorem in Bounded Arithmetic , 1990, CSL.

[12]  Thom W. Frühwirth,et al.  Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction , 2013, TOCL.

[13]  Albert Atserias,et al.  A combinatorial characterization of resolution width , 2008, J. Comput. Syst. Sci..

[14]  Barnaby Martin,et al.  Parameterized Proof Complexity , 2010, computational complexity.

[15]  Massimo Lauria,et al.  Paris-Harrington Tautologies , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[16]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[17]  Robert Moll,et al.  Examples of hard tautologies in the propositional calculus , 1981, STOC '81.

[18]  Ronald L. Graham,et al.  Erdős on Graphs , 2020 .