Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]