%0 Journal Article %1 journals/combinatorica/LauriaPRT17 %A Lauria, Massimo %A Pudlák, Pavel %A Rödl, Vojtech %A Thapen, Neil %D 2017 %J Combinatorica %K dblp %N 2 %P 253-268 %T The complexity of proving that a graph is Ramsey. %U http://dblp.uni-trier.de/db/journals/combinatorica/combinatorica37.html#LauriaPRT17 %V 37

@article{journals/combinatorica/LauriaPRT17, added-at = {2019-06-02T00:00:00.000+0200}, author = {Lauria, Massimo and Pudlák, Pavel and Rödl, Vojtech and Thapen, Neil}, biburl = {https://www.bibsonomy.org/bibtex/2744d66a09bdeac61dd525f34c218420c/dblp}, ee = {https://www.wikidata.org/entity/Q61732573}, interhash = {fe10c5767e3efbd6c97b95a301b1e3c5}, intrahash = {744d66a09bdeac61dd525f34c218420c}, journal = {Combinatorica}, keywords = {dblp}, number = 2, pages = {253-268}, timestamp = {2019-06-04T11:37:50.000+0200}, title = {The complexity of proving that a graph is Ramsey.}, url = {http://dblp.uni-trier.de/db/journals/combinatorica/combinatorica37.html#LauriaPRT17}, volume = 37, year = 2017 }