The complexity of proving that a graph is Ramsey
Sign Up to like & getrecommendations! Published in 2017 at "Combinatorica"
DOI: 10.1007/s00493-015-3193-9
Abstract: We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size c log n. We define a CNF formula which expresses this… read more here.
Keywords: ramsey; graph; complexity proving; graph ramsey ... See more keywords