The complexity of proving that a graph is Ramsey

Massimo Lauria Pavel Pudlák Vojtech Rödl Neil Thapen

Published in: CoRR (2013)

Keyphrases

graph representation
graph theory
computational complexity
graph matching
graph structure
worst case
connected components
directed graph
graph theoretic
database
real time
website
markov random field
random walk
spanning tree
graphical representation