Number of the records: 1
The complexity of proving that a graph is Ramsey
- 1.Lauria, M. - Pudlák, Pavel - Rödl, V. - Thapen, Neil
The complexity of proving that a graph is Ramsey.
Combinatorica. Roč. 37, č. 2 (2017), s. 253-268. ISSN 0209-9683. E-ISSN 1439-6912
OECD category: Pure mathematics
Impact factor: 1.406, year: 2017
http://link.springer.com/article/10.1007%2Fs00493-015-3193-9
http://hdl.handle.net/11104/0271451
Number of the records: 1