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]
@article{LauriaPRT13-0,
title = {The complexity of proving that a graph is Ramsey},
author = {Massimo Lauria and Pavel Pudlák and Vojtech Rödl and Neil Thapen},
year = {2013},
url = {http://eccc.hpi-web.de/report/2013/038},
researchr = {https://researchr.org/publication/LauriaPRT13-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {20},
pages = {38},
}