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 logn. 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 Ramsey graph must contain a large subgraph with some of the statistical properties of the random graph.

[1]  Peter Keevash,et al.  The early evolution of the H-free process , 2009, 0908.0429.

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

[3]  Archie Blake.  Canonical expressions in Boolean algebra , 1938 .

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

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

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

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

[8]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

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

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

[11]  D. Conlon.  A new upper bound for diagonal Ramsey numbers , 2006, math/0607788.

[12]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[13]  Albert Atserias,et al.  A combinatorial characterization of resolution width , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[14]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

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

[16]  Jan Kra,et al.  Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .

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

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

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

[20]  Olaf Beyersdorff,et al.  Parameterized Complexity of DPLL Search Procedures , 2011, SAT.

[21]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

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

[24]  Gary Chartrand,et al.  Erdős on Graphs : His Legacy of Unsolved Problems , 2011 .

[25]  Pavel Pudl.  A lower bound on the size of resolution proofs of the Ramsey theorem , 2012 .

[26]  Archie Blake,et al.  Corrections to Canonical expressions in Boolean algebra , 1938, Journal of Symbolic Logic.

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

[28]  Joel H. Spencer,et al.  Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..

[29]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[30]  Jeong Han Kim,et al.  The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

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