{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T10:30:34Z","timestamp":1663583434668},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:00:00Z","timestamp":1579305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:00:00Z","timestamp":1579305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"CONICYT DoctoralFellowship","award":["21141116"],"award-info":[{"award-number":["21141116"]}]},{"name":"Santander Travel Research Fund"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Extending a result of Rado to hypergraphs, we prove that for all <jats:inline-formula><jats:alternatives><jats:tex-math>$$s, k, t \\in {\\mathbb {N}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>s<\/mml:mi><mml:mo>,<\/mml:mo><mml:mi>k<\/mml:mi><mml:mo>,<\/mml:mo><mml:mi>t<\/mml:mi><mml:mo>\u2208<\/mml:mo><mml:mi>N<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula> with <jats:inline-formula><jats:alternatives><jats:tex-math>$$k \\ge t \\ge 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>k<\/mml:mi><mml:mo>\u2265<\/mml:mo><mml:mi>t<\/mml:mi><mml:mo>\u2265<\/mml:mo><mml:mn>2<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the vertices of every <jats:inline-formula><jats:alternatives><jats:tex-math>$$r = s(k-t+1)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>r<\/mml:mi><mml:mo>=<\/mml:mo><mml:mi>s<\/mml:mi><mml:mo>(<\/mml:mo><mml:mi>k<\/mml:mi><mml:mo>-<\/mml:mo><mml:mi>t<\/mml:mi><mml:mo>+<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-edge-coloured countably infinite complete <jats:italic>k<\/jats:italic>-graph can be partitioned into the cores of at most <jats:italic>s<\/jats:italic> monochromatic <jats:italic>t<\/jats:italic>-tight Berge-paths of different colours. We further describe a construction showing that this result is best possible.<\/jats:p>","DOI":"10.1007\/s00373-019-02113-3","type":"journal-article","created":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T07:02:21Z","timestamp":1579330941000},"page":"437-444","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths"],"prefix":"10.1007","volume":"36","author":[{"given":"Sebasti\u00e1n","family":"Bustamante","sequence":"first","affiliation":[]},{"given":"Jan","family":"Corsten","sequence":"additional","affiliation":[]},{"given":"N\u00f3ra","family":"Frankl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,18]]},"reference":[{"issue":"4","key":"2113_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. Comb. Probab. Comput. 17(4), 471\u2013486 (2008)","journal-title":"Comb. Probab. Comput."},{"key":"2113_CR2","unstructured":"Ayel, J.: Sur l\u2019existence de deux cycles suppl\u00e9mentaires unicolores, disjoints et de couleurs diff\u00e9rentes dans un graphe complet bicolore, Ph.D. thesis, Universit\u00e9 Joseph-Fourier-Grenoble I (1979)"},{"issue":"2","key":"2113_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. Comb. Theory Ser. B 100(2), 176\u2013180 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2113_CR4","doi-asserted-by":"crossref","unstructured":"Bustamante, S., Corsten, J., Frankl, N., Pokrovskiy, A., Skokan, J.: Partitioning edge-coloured hypergraphs into few monochromatic tight cycles. arXiv:1903.04471 (2019)","DOI":"10.1137\/19M1269786"},{"issue":"8","key":"2113_CR5","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., 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":"2113_CR6","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. Comb. Theory Ser. B 51(1), 90\u201395 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2113_CR7","unstructured":"Gerbner, D., Methuku, A., Omidi, G., Vizer, M.: Monochromatic Berge cycles in uniform hypergraphs (2019) (unpublished manuscript)"},{"issue":"2","key":"2113_CR8","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.jctb.2007.07.002","volume":"98","author":"A Gy\u00e1rf\u00e1s","year":"2008","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J., S\u00e1rk\u00f6zy, G., Schelp, R.: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory Ser. B 98(2), 342\u2013358 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"6","key":"2113_CR9","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., Szemer\u00e9di, E.: An improved bound for the monochromatic cycle partition number. J. Comb. Theory Ser. B 96(6), 855\u2013873 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2113_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.37236\/2631","volume":"20","author":"A Gy\u00e1rf\u00e1s","year":"2013","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.: Monochromatic path and cycle partitions in hypergraphs. Electron. J. Comb. 20(1), 18 (2013)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"2113_CR11","first-page":"2","volume":"21","author":"A Gy\u00e1rf\u00e1s","year":"2014","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.: Monochromatic loose-cycle partitions in hypergraphs. Electron. J. Comb. 21(2), 2\u201336 (2014)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"2113_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00373-010-0908-y","volume":"26","author":"A Gy\u00e1rf\u00e1s","year":"2010","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G., Szemer\u00e9di, E.: Long monochromatic Berge cycles in colored 4-uniform hypergraphs. Graphs Comb. 26(1), 71\u201376 (2010)","journal-title":"Graphs Comb."},{"issue":"2","key":"2113_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00026-010-0058-1","volume":"14","author":"A Gy\u00e1rf\u00e1s","year":"2010","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G., Szemer\u00e9di, E.: Monochromatic matchings in the shadow graph of almost complete hypergraphs. Ann. Comb. 14(2), 245\u2013249 (2010)","journal-title":"Ann. Comb."},{"issue":"4","key":"2113_CR14","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. Comb. Probab. Comput. 7(4), 423\u2013436 (1998)","journal-title":"Comb. Probab. Comput."},{"issue":"8","key":"2113_CR15","doi-asserted-by":"publisher","first-page":"2043","DOI":"10.1016\/j.disc.2016.09.032","volume":"340","author":"L Maherani","year":"2017","unstructured":"Maherani, L., Omidi, G.R.: Monochromatic Hamiltonian Berge-cycles in colored hypergraphs. Discrete Math. 340(8), 2043\u20132052 (2017)","journal-title":"Discrete Math."},{"key":"2113_CR16","unstructured":"Omidi, G.R.: A proof for a conjecture of Gy\u00e1rf\u00e1s, Lehel, S\u00e1rk\u00f6zy and Schelp on Berge-cycles. arXiv:1404.3385 (2014)"},{"key":"2113_CR17","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. Comb. Theory Ser. B 106, 70\u201397 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2113_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0167-5060(08)70507-7","volume":"3","author":"R Rado","year":"1978","unstructured":"Rado, R.: Monochromatic paths in graphs. Ann. Discrete Math. 3, 191\u2013194 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"2113_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"2","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 2(1), 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2113_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.disc.2014.06.025","volume":"334","author":"G S\u00e1rk\u00f6zy","year":"2014","unstructured":"S\u00e1rk\u00f6zy, G.: Improved monochromatic loose cycle partitions in hypergraphs. Discrete Math. 334, 52\u201362 (2014)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02113-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02113-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02113-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T00:21:46Z","timestamp":1610842906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02113-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,18]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2113"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02113-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,18]]},"assertion":[{"value":"13 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}