The complexity of proving that a graph is Ramsey
- 139 Downloads
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.
Mathematics Subject Classification (2000)03F20 05C55
Unable to display preview. Download preview PDF.
- E. Ben-Sasson and A. Wigderson: Short proofs are narrow - resolution made simple, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 517–526, 1999.Google Scholar
- L. Carlucci, N. Galesi and M. Lauria: Paris-Harrington tautologies, in: Proc. of IEEE 26th Conference on Computational Complexity, 93–103, 2011.Google Scholar
- F. R. K. Chung, P. Erdős and R. L. Graham: Erdős on Graphs: His Legacy of Unsolved Problems, AK Peters, Ltd., 1 edition, 1998.Google Scholar
- J. Krajíček: Tautologies from pseudo-random generators, Bulletin of Symbolic Logic, 197–212, 2001.Google Scholar
- B. Krishnamurthy and R. N. Moll: Examples of hard tautologies in the propositional calculus, in: STOC 1981, 13th ACM Symposium on Th. of Computing, 28–37, 1981.Google Scholar
- P. Pudlák: Ramsey’s theorem in Bounded Arithmetic, in: Proceedings of Computer Science Logic 1990, 308–317, 1991.Google Scholar