Request file
Review/Citation: LAURIA, M., PUDLÁK, Pavel, RÖDL, V., THAPEN, Neil. The complexity of proving that a graph is Ramsey. Combinatorica. 2017, 37(2), 253-268. ISSN 0209-9683. E-ISSN 1439-6912
Requested document: Pudlak1.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.