Number of the records: 1
The complexity of proving that a graph is Ramsey
- 1.Lauria, M., Pudlák, P., Rödl, V., Thapen, N. The complexity of proving that a graph is Ramsey. Combinatorica. 2017, 37(2), 253-268. ISSN 0209-9683. E-ISSN 1439-6912. Available: doi: 10.1007/s00493-015-3193-9.
Number of the records: 1