The complexity of proving that a graph is Ramsey
Lauria, Massimo ; Pudlák, Pavel ; Rödl, Vojtěch ; Thapen, Neil
Combinatorica (Budapest. 1981), 2017-04, Vol.37 (2), p.253-268
[Periódico revisado por pares]
Berlin/Heidelberg: Springer Berlin Heidelberg
Texto completo disponível