Basket

0474390 - MÚ 2018 RIV HU eng J - Journal Article
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
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : complexity * c-Ramsey graphs
OECD category: Pure mathematics
Impact factor: 1.406, year: 2017
http://link.springer.com/article/10.1007%2Fs00493-015-3193-9
Permanent Link: http://hdl.handle.net/11104/0271451