Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. The Complexity of Proving That a Graph Is Ramsey. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Volume 7965 of Lecture Notes in Computer Science, pages 684-695, Springer, 2013. [doi]
@inproceedings{LauriaPRT13,
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},
doi = {10.1007/978-3-642-39206-1_58},
url = {http://dx.doi.org/10.1007/978-3-642-39206-1_58},
researchr = {https://researchr.org/publication/LauriaPRT13},
cites = {0},
citedby = {0},
pages = {684-695},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I},
editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg},
volume = {7965},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-39205-4},
}