{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T13:57:09Z","timestamp":1718459829464},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00233-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"87-98","source":"Crossref","is-referenced-by-count":20,"title":["Generalized and geometric Ramsey numbers for cycles"],"prefix":"10.1016","volume":"263","author":[{"given":"Gyula","family":"K\u00e1rolyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Rosta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00233-4_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(71)90019-7","article-title":"Large cycles in graphs","volume":"1","author":"Bondy","year":"1971","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S0095-8956(73)80005-X","article-title":"Ramsey numbers for cycles in graphs","volume":"14","author":"Bondy","year":"1973","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB3","doi-asserted-by":"crossref","unstructured":"S.A. Burr, Generalized Ramsey theory for graphs \u2013 a survey, in: R. Bari, F. Harary (Eds.), Graphs and Combinatorics Lecture Notes in Mathematics, Springer, Berlin, vol. 406, 1974,, pp. 52\u201375.","DOI":"10.1007\/BFb0066435"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1090\/S0002-9947-1972-0317992-9","article-title":"On a variation of the Ramsey number","volume":"173","author":"Chartrand","year":"1972","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jgt.3190010118","article-title":"Tree \u2013 complete graph Ramsey numbers","volume":"1","author":"Chv\u00e1tal","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB7","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","article-title":"Some remarks on the theory of graphs","volume":"53","author":"Erd\u0151s","year":"1947","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB9","first-page":"53","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Comput. Math."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(74)90151-4","article-title":"All Ramsey numbers for cycles in graphs","volume":"8","author":"Faudree","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/jgt.3190160105","article-title":"Ramsey problems and their connections to Tur\u00e1n-type extremal problems","volume":"16","author":"Faudree","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB12","first-page":"167","article-title":"On Ramsey-type problems","volume":"X","author":"Gerencs\u00e9r","year":"1967","journal-title":"Ann. Univ. Sci. R. E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB13","series-title":"Ramsey Theory","author":"Graham","year":"1990"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2307\/2323956","article-title":"Embedding a planar triangulation with vertices at specified points (solution to problem E3341)","volume":"98","author":"Gritzmann","year":"1991","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0012-365X(99)00403-3","article-title":"Coloring arca of convex sets","volume":"220","author":"Harborth","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB16","doi-asserted-by":"crossref","unstructured":"Gy. K\u00e1rolyi, J. Pach, G. T\u00f3th, Ramsey-type results for geometric graphs. I, Proc. 12th Annual ACM Symp. on Computational Geometry, Philadelphia, 1996, pp. 359\u2013365; Discrete Comput. Geom. 18 (1997) 247\u2013255.","DOI":"10.1007\/PL00009317"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB17","doi-asserted-by":"crossref","unstructured":"Gy. K\u00e1rolyi, J. Pach, G. T\u00f3th, P. Valtr, Ramsey-type results for geometric graphs. II, Proc. 13th Annu. ACM Symp. on Computational Geometry, Nice, 1997, pp. 94\u2013103; Discrete Comput. Geom. 20 (1998) 375\u2013388.","DOI":"10.1007\/PL00009391"},{"issue":"DS1","key":"10.1016\/S0304-3975(00)00233-4_BIB18","first-page":"27","article-title":"Small Ramsey numbers","volume":"1","author":"Radziszowski","year":"1994","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","article-title":"On a problem of formal logic","volume":"30","author":"Ramsey","year":"1930","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0304-3975(00)00233-4_BIB20","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(73)90035-X","article-title":"On a Ramsey type problem of J.A. Bondy and P. Erd\u0151s. I\u2013II","volume":"15","author":"Rosta","year":"1973","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0304-3975(00)00233-4_BIB21","first-page":"114","article-title":"\u00dcber die Kongruenz xm+ym\u2261 zm (modp)","volume":"25","author":"Schur","year":"1916","journal-title":"Jahresber. Deutschen Math.-Verein."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:35Z","timestamp":1556792495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002334"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00233-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}