{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T13:40:31Z","timestamp":1730554831227,"version":"3.28.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00493-023-00072-1","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T17:02:19Z","timestamp":1700586139000},"page":"311-335","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Jan","family":"Corsten","sequence":"first","affiliation":[]},{"given":"Walner","family":"Mendon\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"issue":"4","key":"72_CR1","doi-asserted-by":"publisher","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. Combin. Probab. Comput. 17(4), 471\u2013486 (2008)","journal-title":"Combin. Probab. Comput."},{"key":"72_CR2","unstructured":"Ayel, J.: Sur l\u2019existence de deux cycles suppl\u00e9mentaires unicolores, disjoints et de couleurs diff\u00e9rentes dans un graphe complet bicolore, Theses, Universit\u00e9 Joseph-Fourier \u2014 Grenoble I, (1979)"},{"issue":"2","key":"72_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.jctb.2009.07.001","volume":"100","author":"S Bessy","year":"2010","unstructured":"Bessy, S., Thomass\u00e9, S.: Partitioning a graph into a cycle and an anticycle, a proof of Lehel\u2019s conjecture. J. Combin. Theory Ser. B 100(2), 176\u2013180 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"72_CR4","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1137\/13093827X","volume":"29","author":"J B\u00f6ttcher","year":"2015","unstructured":"B\u00f6ttcher, J., Kohayakawa, Y., Taraz, A., W\u00fcrfl, A.: An extension of the blow-up lemma to arrangeable graphs. SIAM J. Discrete Math. 29(2), 962\u20131001 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"72_CR5","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1137\/19M1269786","volume":"34","author":"S Bustamante","year":"2020","unstructured":"Bustamante, S., Corsten, J., Frankl, N., Pokrovskiy, A., Skokan, J.: Partitioning hypergraphs into few monochromatic tight cycles. SIAM J. Discrete Math. 34(2), 1460\u20131471 (2020)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"72_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.1993.1012","volume":"57","author":"GT Chen","year":"1993","unstructured":"Chen, G.T., Schelp, R.H.: Graphs with linearly bounded Ramsey numbers. J. Combin. Theory Ser. B 57(1), 138\u2013149 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"72_CR7","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s00039-012-0171-x","volume":"22","author":"D Conlon","year":"2012","unstructured":"Conlon, D., Fox, J.: Bounds for graph regularity and removal lemmas. Geom. Funct. Anal. 22(5), 1191\u20131256 (2012)","journal-title":"Geom. Funct. Anal."},{"issue":"5","key":"72_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00493-012-2710-3","volume":"32","author":"D Conlon","year":"2012","unstructured":"Conlon, D., Fox, J., Sudakov, B.: On two problems in graph Ramsey theory. Combinatorica 32(5), 513\u2013535 (2012)","journal-title":"Combinatorica"},{"issue":"3","key":"72_CR9","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0097539793247634","volume":"24","author":"RA Duke","year":"1995","unstructured":"Duke, R.A., Lefmann, H., R\u00f6dl, V.: A fast approximation algorithm for computing the frequencies of subgraphs in a given graph. SIAM J. Comput. 24(3), 598\u2013620 (1995)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"72_CR10","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1016\/j.disc.2016.09.028","volume":"340","author":"M Elekes","year":"2017","unstructured":"Elekes, M., Soukup, D.T., Soukup, L., Szentmikl\u00f3ssy, Z.: Decompositions of edge-colored infinite complete graphs into monochromatic paths. Discrete Math. 340(8), 2053\u20132069 (2017)","journal-title":"Discrete Math."},{"issue":"1","key":"72_CR11","doi-asserted-by":"publisher","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. Combin. Theory Ser. B 51(1), 90\u201395 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"72_CR12","first-page":"463","volume":"2","author":"P Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"issue":"2","key":"72_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","volume":"29","author":"J Fox","year":"2009","unstructured":"Fox, J., Sudakov, B.: Density theorems for bipartite graphs and related Ramsey-type results. Combinatorica 29(2), 153\u2013196 (2009)","journal-title":"Combinatorica"},{"issue":"5","key":"72_CR14","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s00493-016-3274-4","volume":"37","author":"J Fox","year":"2017","unstructured":"Fox, J., Lov\u00e1sz, L.M.: A tight lower bound for Szemer\u00e9di\u2019s regularity lemma. Combinatorica 37(5), 911\u2013951 (2017)","journal-title":"Combinatorica"},{"key":"72_CR15","doi-asserted-by":"crossref","unstructured":"Frieze, A.M., Kannan, R.: The regularity lemma and approximation schemes for dense problems. In: Proceedings of 37th Conference on Foundations of Computer Science, IEEE, pp.\u00a012\u201320 (1996)","DOI":"10.1109\/SFCS.1996.548459"},{"issue":"3","key":"72_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1002\/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C","volume":"35","author":"RL Graham","year":"2000","unstructured":"Graham, R.L., R\u00f6dl, V., Ruci\u0144ski, A.: On graphs with linear Ramsey numbers. J. Graph Theory 35(3), 176\u2013192 (2000)","journal-title":"J. Graph Theory"},{"issue":"1","key":"72_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.disc.2015.07.005","volume":"339","author":"A Grinshpun","year":"2016","unstructured":"Grinshpun, A., S\u00e1rk\u00f6zy, G.N.: Monochromatic bounded degree subgraph partitions. Discrete Math. 339(1), 46\u201353 (2016)","journal-title":"Discrete Math."},{"issue":"6","key":"72_CR18","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.jctb.2006.02.007","volume":"96","author":"A Gy\u00e1rf\u00e1s","year":"2006","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: An improved bound for the monochromatic cycle partition number. J. Combin. Theory Ser. B 96(6), 855\u2013873 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"72_CR19","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u0151s, Combinatorial theory and its applications, II (Proc. Colloq., Balatonf\u00fcred, 1969), pp.\u00a0601\u2013623 (1970)"},{"issue":"1","key":"72_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J Koml\u00f3s","year":"1997","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Blow-up lemma. Combinatorica 17(1), 109\u2013123 (1997)","journal-title":"Combinatorica"},{"issue":"3","key":"72_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q","volume":"12","author":"J Koml\u00f3s","year":"1998","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: An algorithmic version of the blow-up lemma. Random Struct. Algorithms 12(3), 297\u2013312 (1998)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"72_CR22","doi-asserted-by":"publisher","first-page":"791","DOI":"10.4007\/annals.2017.185.3.2","volume":"185","author":"C Lee","year":"2017","unstructured":"Lee, C.: Ramsey numbers of degenerate graphs. Ann. Math. 185(3), 791\u2013829 (2017)","journal-title":"Ann. Math."},{"issue":"4","key":"72_CR23","doi-asserted-by":"publisher","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-coloured complete graphs into two monochromatic cycles. Combin. Probab. Comput. 7(4), 423\u2013436 (1998)","journal-title":"Combin. Probab. Comput."},{"key":"72_CR24","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jctb.2014.01.003","volume":"106","author":"A Pokrovskiy","year":"2014","unstructured":"Pokrovskiy, A.: Partitioning edge-coloured complete graphs into monochromatic cycles and paths. J. Combin. Theory Ser. B 106, 70\u201397 (2014)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"72_CR25","first-page":"264","volume":"30","author":"FP Ramsey","year":"1929","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30(4), 264\u2013286 (1929)","journal-title":"Proc. Lond. Math. Soc."},{"key":"72_CR26","unstructured":"S\u00e1rk\u00f6zy, G.N.: A quantitative version of the Blow-up lemma, arxiv:1405.7302 (2014)"},{"issue":"2","key":"72_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.disc.2016.08.009","volume":"340","author":"GN S\u00e1rk\u00f6zy","year":"2017","unstructured":"S\u00e1rk\u00f6zy, G.N.: Monochromatic cycle power partitions. Discrete Math. 340(2), 72\u201380 (2017)","journal-title":"Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00072-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00072-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00072-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T13:11:37Z","timestamp":1730553097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00072-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,21]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00072-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2023,11,21]]},"assertion":[{"value":"23 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}