The complexity of proving that a graph is Ramsey

Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. The complexity of proving that a graph is Ramsey. Electronic Colloquium on Computational Complexity (ECCC), 20:38, 2013. [doi]

Abstract

Abstract is missing.