{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:29:59Z","timestamp":1777451399381,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T00:00:00Z","timestamp":1381449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00373-013-1372-2","type":"journal-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T17:07:15Z","timestamp":1381511235000},"page":"131-140","source":"Crossref","is-referenced-by-count":7,"title":["Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems"],"prefix":"10.1007","volume":"31","author":[{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor N.","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley","family":"Selkow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,11]]},"reference":[{"key":"1372_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1017\/S0963548308009164","volume":"17","author":"P. Allen","year":"2008","unstructured":"Allen P.: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. Comb. Probab. Comput. 17, 471\u2013486 (2008)","journal-title":"Comb. Probab. Comput."},{"key":"1372_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/S0002-9947-1975-0409255-0","volume":"209","author":"S.A. Burr","year":"1975","unstructured":"Burr S.A., Erd\u0151s P., Spencer J.H.: Ramsey theorems for multiple copies of graphs. Trans. Am. Math. Soc. 209, 87\u201399 (1975)","journal-title":"Trans. Am. Math. Soc."},{"key":"1372_CR3","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.jctb.2009.07.001","volume":"100","author":"S. Bessy","year":"2009","unstructured":"Bessy S., Thomass\u00e9 S.: Partitioning a graph into a cycle and an anticycle, a proof of Lehel\u2019s conjecture. J. Comb. Theory B 100, 176\u2013180 (2009)","journal-title":"J. Comb. Theory B"},{"key":"1372_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(78)90084-5","volume":"2","author":"K.M. Chung","year":"1978","unstructured":"Chung K.M., Liu C.L.: A generalization of Ramsey theory for graphs. Discret. Math. 2, 117\u2013127 (1978)","journal-title":"Discret. Math."},{"key":"1372_CR5","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1017\/S1446788700029554","volume":"19","author":"E.J. Cockayne","year":"1975","unstructured":"Cockayne E.J., Lorimer P.J.: The Ramsey number for stripes. J. Aust. Math. Soc. 19, 252\u2013256 (1975)","journal-title":"J. Aust. Math. Soc."},{"key":"1372_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P., Gallai T.: On maximal paths and circuits of graphs. Acta Math. Sci. Hung. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Sci. Hung."},{"key":"1372_CR7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","volume":"51","author":"P. Erd\u0151s","year":"1991","unstructured":"Erd\u0151s P., Gy\u00e1rf\u00e1s A., Pyber L.: Vertex coverings by monochromatic cycles and trees. J. Comb. Theory B 51, 90\u201395 (1991)","journal-title":"J. Comb. Theory B"},{"key":"1372_CR8","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.jctb.2006.09.001","volume":"97","author":"A. Figaj","year":"2007","unstructured":"Figaj A., Luczak T.: The Ramsey number for a triple of long even cycles. J. Comb. Theory Ser B 97, 584\u2013596 (2007)","journal-title":"J. Comb. Theory Ser B"},{"key":"1372_CR9","first-page":"167","volume":"10","author":"L. Gerencs\u00e9r","year":"1967","unstructured":"Gerencs\u00e9r L., Gy\u00e1rf\u00e1s A.: On Ramsey type problems. Ann. Univ. Sci. E\u00f6tv\u00f6s Bp 10, 167\u2013170 (1967)","journal-title":"Ann. Univ. Sci. E\u00f6tv\u00f6s Bp"},{"key":"1372_CR10","unstructured":"Gy\u00e1rf\u00e1s, A.: Partition coverings and blocking sets in hypergraphs. Commun. Comput. Autom. Inst. Hung. Acad. Sci. 71 (1977) 62\u00a0pp (in Hungarian)"},{"key":"1372_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190070116","volume":"7","author":"A. Gy\u00e1rf\u00e1s","year":"1983","unstructured":"Gy\u00e1rf\u00e1s A.: Vertex coverings by monochromatic paths and cycles. J. Graph Theory 7, 131\u2013135 (1983)","journal-title":"J. Graph Theory"},{"key":"1372_CR12","first-page":"201","volume":"109","author":"A. Gy\u00e1rf\u00e1s","year":"1995","unstructured":"Gy\u00e1rf\u00e1s A.: Monochromatic path covers. Congr. Numer. 109, 201\u2013202 (1995)","journal-title":"Congr. Numer."},{"key":"1372_CR13","unstructured":"Gy\u00e1rf\u00e1s, A.: Large Matchings with Few Colors: A Problem for the \u2018Eml\u00e9kt\u00e1bla\u2019 workshop (2010). http:\/\/www.renyi.hu\/~emlektab\/index_booklet.html"},{"key":"1372_CR14","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A.: Large monochromatic components in edge colorings of graphs: a survey. In: Ramsey theory, Program Mathematics, vol. 285, pp. 77\u201396. Birkh\u00e4user\/Springer, New York (2011)","DOI":"10.1007\/978-0-8176-8092-3_5"},{"key":"1372_CR15","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: One-sided coverings of complete bipartite graphs. In: Algorithms and Combinatorics, vol. 26, pp. 133\u2013144. Topics in Discrete Mathematics (2006)","DOI":"10.1007\/3-540-33700-8_8"},{"key":"1372_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00493-007-0043-4","volume":"27","author":"A. Gy\u00e1rf\u00e1s","year":"2007","unstructured":"Gy\u00e1rf\u00e1s A., Ruszink\u00f3 M., S\u00e1rk\u00f6zy G.N., Szemer\u00e9di E.: Three-color Ramsey numbers for paths. Combinatorica 27, 35\u201369 (2007)","journal-title":"Combinatorica"},{"key":"1372_CR17","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Partitioning 3-colored complete graphs into three monochromatic cycles. Electron. J. Comb. 18, N53 (2011)","DOI":"10.37236\/540"},{"key":"1372_CR18","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: The Ramsey number of diamond matchings and loose cycles in hypergraphs. Electron. J. Comb. 15, R126 (2008)","DOI":"10.37236\/850"},{"key":"1372_CR19","unstructured":"Heinrich, K.: Personal communication (1994)"},{"key":"1372_CR20","unstructured":"Henderson, J.R.: Permutation Decomposition of (0\u20131)-Matrices and Decomposition Transversals, Ph.D. thesis, Caltech (1971)"},{"issue":"10","key":"1372_CR21","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1080\/00207160.2012.685469","volume":"89","author":"A. Khamseh","year":"2012","unstructured":"Khamseh A., Omidi G.R.: A generalization of Ramsey theory for linear forests. Int. J. Comput. Math. 89(10), 1303\u20131310 (2012)","journal-title":"Int. J. Comput. Math."},{"key":"1372_CR22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/jgt.3190020112","volume":"2","author":"P.J. Lorimer","year":"1978","unstructured":"Lorimer P.J., Segedin R.J.: Ramsey numbers for multiple copies of complete graphs. J. Graph Theory 2, 89\u201391 (1978)","journal-title":"J. Graph Theory"},{"key":"1372_CR23","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1017\/S0963548398003599","volume":"7","author":"T. \u0141uczak","year":"1998","unstructured":"\u0141uczak T., R\u00f6dl V., Szemer\u00e9di E.: Partitioning two-colored complete graphs into two monochromatic cycles. Comb. Probab. Comput. 7, 423\u2013436 (1998)","journal-title":"Comb. Probab. Comput."},{"key":"1372_CR24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1155\/S0161171286000339","volume":"9","author":"R. Meenakshi","year":"1986","unstructured":"Meenakshi R., Sundararaghavan P.S.: Generalized Ramsey numbers for paths in 2-chromatic graphs. Intern. J. Math. Math. Sci. 9, 273\u2013276 (1986)","journal-title":"Intern. J. Math. Math. Sci."},{"key":"1372_CR25","first-page":"89","volume":"3","author":"R. Rado","year":"1987","unstructured":"Rado R.: Monochromatic paths in graphs. Ann. Discret. Math. 3, 89\u201391 (1987)","journal-title":"Ann. Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1372-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1372-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1372-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T18:43:59Z","timestamp":1596653039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1372-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1372"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1372-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,11]]}}}