The complexity of proving that a graph is Ramsey.

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

Published in: Electron. Colloquium Comput. Complex. (2013)

Keyphrases

computational complexity
graph theory
worst case
random walk
structured data
graph structure
polynomial time complexity
real time
machine learning
computational cost
probabilistic model
graph matching
weighted graph
graph databases
spanning tree
bounded treewidth