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. Combinatorica, 37(2):253-268, 2017. [doi]

Abstract

Abstract is missing.