The complexity of proving that a graph is Ramsey

LAURIA, M., PUDLÁK, P., THAPEN, N., RÖDL, V. The complexity of proving that a graph is Ramsey. In: FOMIN, F.V., FREIVALDS, R., KWIATKOWSKA, M., PELEG, D., eds. Automata, Languages, and Programming. Part I. Berlin: Springer, 2013, s. 684-695. Lecture Notes in Computer Science, 7965. ISBN 978-3-642-39205-4. Dostupné z: doi: 10.1007/978-3-642-39206-1_58.