"The complexity of proving that a graph is Ramsey."

Massimo Lauria et al. (2017)
a service of Schloss Dagstuhl - Leibniz Center for Informatics