{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:48:40Z","timestamp":1772520520708,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T00:00:00Z","timestamp":1562630400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T00:00:00Z","timestamp":1562630400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00493-018-3724-2","type":"journal-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T14:19:44Z","timestamp":1562681984000},"page":"847-878","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Density of Monochromatic Infinite Subgraphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Louis","family":"DeBiasio","sequence":"first","affiliation":[]},{"given":"Paul","family":"McKenney","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,9]]},"reference":[{"key":"3724_CR1","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.endm.2015.06.086","volume":"49","author":"P Allen","year":"2015","unstructured":"P. Allen, B. Roberts and J. Skokan: Ramsey numbers of squares of paths, Electronic Notes in Discrete Mathematics\n                           49 (2015), 637\u2013641.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"3724_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S0963548312000090","volume":"21","author":"F Benevides","year":"2012","unstructured":"F. Benevides, T. Luczak, J. Skokan, A. Scott and M. White: Monochromatic cycles in 2-coloured graphs, Combinatorics, Probability, and Computing, 21 (2012), 57\u201387.","journal-title":"Combinatorics, Probability, and Computing"},{"key":"3724_CR3","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1976","unstructured":"C. Berge: Graphs and Hypergraphs, second revised edition, Amsterdam: North-Holland Publishing Co., 1976."},{"key":"3724_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"34","author":"C Chvat\u00e1l","year":"1983","unstructured":"C. Chvat\u00e1l, V. R\u00f6dl, E. Szemer\u00e9di and W. T. Trotter: The Ramsey number of a graph with bounded maximum degree, Journal of Combinatorial Theory, Series B\n                           34 (1983), 239\u2013243.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3724_CR5","unstructured":"J. Corsten: Personal communication."},{"key":"3724_CR6","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1016\/j.disc.2016.09.028","volume":"340","author":"M Elekes","year":"2017","unstructured":"M. Elekes, D. Soukup, L. Soukup and Z. Szentmikl\u00f3ssy: Decompositions of edge-colored infinite complete graphs into monochromatic paths, Discrete Mathematics\n                           340 (2017), 2053\u20132069.","journal-title":"Discrete Mathematics"},{"key":"3724_CR7","doi-asserted-by":"publisher","first-page":"619","DOI":"10.4153\/CMB-1964-059-6","volume":"7","author":"P Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s: Some remarks on Ramsay\u2019s theorem, Canadian Mathematical Bulletin\n                           7 (1964), 619\u2013622.","journal-title":"Canadian Mathematical Bulletin"},{"key":"3724_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0012-365X(91)90135-O","volume":"87","author":"P Erd\u0151s","year":"1991","unstructured":"P. Erd\u0151s and F. Galvin: Some Ramsey-type theorems, Discrete Mathematics\n                           87 (1991), 261\u2013269.","journal-title":"Discrete Mathematics"},{"key":"3724_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0012-365X(93)90508-Q","volume":"113","author":"P Erd\u0151s","year":"1993","unstructured":"P. Erd\u0151s and F. Galvin: Monochromatic infinite paths, Discrete Mathematics\n                           113 (1993), 59\u201370.","journal-title":"Discrete Mathematics"},{"key":"3724_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","volume":"51","author":"P Erd\u0151s","year":"1991","unstructured":"P. Erd\u0151s, A. Gy\u00e1rf\u00e1s and L. Pyber: Vertex coverings by monochromatic cycles and trees, Journal of Combinatorial Theory, Series B\n                           51 (1991), 90\u201395.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3724_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1112\/S0025579300014054","volume":"45","author":"I Farah","year":"1998","unstructured":"I. Farah: Semiselective coideals, Mathematika\n                           45 (1998), 79\u2013103.","journal-title":"Mathematika"},{"key":"3724_CR12","first-page":"167","volume":"10","author":"L Gerencs\u00e9r","year":"1967","unstructured":"L. Gerencs\u00e9r and A. Gy\u00e1rf\u00e1s: On Ramsey-type problems, Ann. Sci. Budapest. \u00cbotv\u00f6s Sect. Math\n                           10 (1967), 167\u2013170.","journal-title":"Ann. Sci. Budapest. \u00cbotv\u00f6s Sect. Math"},{"key":"3724_CR13","volume-title":"Monochromatic paths in the complete symmetric infinite digraph, manuscript","author":"H Guggiari","year":"2017","unstructured":"H. Guggiari: Monochromatic paths in the complete symmetric infinite digraph, manuscript, arXiv:1710.10900, (2017)."},{"key":"3724_CR14","unstructured":"A. Gy\u00e1rf\u00e1s: Partition covers and blocking sets in hypergraphs, MTA SZTAKI Tanulm\u00e1nyok\n                           71, 1977."},{"key":"3724_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02018597","volume":"3","author":"A Gy\u00e1rf\u00e1s","year":"1973","unstructured":"A. Gy\u00e1rf\u00e1s and J. Lehel: A Ramsey-type problem in directed and bipartite graphs, Periodica Mathematica Hungarica\n                           3 (1973), 299\u2013304.","journal-title":"Periodica Mathematica Hungarica"},{"key":"3724_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00493-007-0043-4","volume":"27","author":"A Gy\u00e1rf\u00e1s","year":"2007","unstructured":"A. Gy\u00e1rf\u00e1s, M. Ruszink\u00f3, G. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Three-color Ramsey numbers for paths, Combinatorica\n                           27 (2007), 35\u201369.","journal-title":"Combinatorica"},{"key":"3724_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0963548311000599","volume":"21","author":"A Gy\u00e1rf\u00e1s","year":"2012","unstructured":"A. xGy\u00e1rf\u00e1s and G. S\u00e1rk\u00f6zy: Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp, Combinatorics, Probability and Computing\n                           21 (2012), 179\u2013186.","journal-title":"Combinatorics, Probability and Computing"},{"key":"3724_CR18","doi-asserted-by":"crossref","unstructured":"A. Gy\u00e1rf\u00e1s, G. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: The Ramsey number of diamond-matchings and loose cycles in hypergraphs, Electron. J. Combin\n                           15 (2008), #R126.","DOI":"10.37236\/850"},{"key":"3724_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1017\/S096354830800967X","volume":"18","author":"P Haxell","year":"2009","unstructured":"P. Haxell, T. Luczak, Y. Peng, V. R\u00f6dl, A. Ruci\u0144ski and J. Skokan: The Ramsey number for 3-uniform tight hypergraph cycles, Combinatorics, Probability and Computing\n                           18 (2009), 165\u2013203.","journal-title":"Combinatorics, Probability and Computing"},{"key":"3724_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jcta.2005.02.005","volume":"113","author":"P Haxell","year":"2006","unstructured":"P. Haxell, T. Luczak, Y. Peng, V. R\u00f6dl, A. Ruci\u0144ski, M. Simonovits and J. Skokan: The Ramsey number for hypergraph cycles I, Journal of Combinatorial Theory, Series A\n                           113 (2006), 67\u201383.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"3724_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/conm\/533\/10503","volume":"533","author":"M Hru\u0161\u00e0k","year":"2011","unstructured":"M. Hru\u0161\u00e0k: Combinatorics of filters and ideals, Set theory and its applications\n                           533, Contemp. Math., Amer. Math. Soc, Providence, RI (2011), 29\u201369.","journal-title":"Set theory and its applications"},{"key":"3724_CR22","volume-title":"Problems and theorems in classical set theory","author":"P Komj\u00e1th","year":"2006","unstructured":"P. Komj\u00e1th and V. Totik: Problems and theorems in classical set theory, Springer Science & Business Media (2006)."},{"key":"3724_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Blow-up lemma, Combinatorica\n                           17 (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"3724_CR24","first-page":"295","volume-title":"Bolyai Society Mathematical Studies 2, Combinatorics, Paul Erd\u0151s is Eighty (Vol. 2)","author":"J Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and M. Simonovits: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, Bolyai Society Mathematical Studies 2, Combinatorics, Paul Erd\u0151s is Eighty (Vol. 2), Budapest (1996), 295\u2013352."},{"key":"3724_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325975.007","volume-title":"Embedding large subgraphs into dense graphs","author":"D K\u00fchn","year":"2009","unstructured":"D. K\u00fchn and D. Osthus: Embedding large subgraphs into dense graphs, arXiv:0901.3541, (2009)."},{"key":"3724_CR26","first-page":"1361","volume":"270","author":"M Las Vergnas","year":"1970","unstructured":"M. Las Vergnas: Sur l\u2019existence des cycles hamiltoniens dans un graphe, CR Acad, Sci. Paris, S\u00e9r. A\n                           270 (1970), 1361\u20131364.","journal-title":"CR Acad, Sci. Paris, S\u00e9r. A"},{"key":"3724_CR27","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1017\/S0963548315000279","volume":"25","author":"S Letzter","year":"2016","unstructured":"S. Letzter: Path Ramsey number for random graphs, Combinatorics, Probability and Computing\n                           25 (2016), 612\u2013622.","journal-title":"Combinatorics, Probability and Computing"},{"key":"3724_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0003-4843(77)90006-7","volume":"12","author":"A R D Mathias","year":"1977","unstructured":"A. R. D. Mathias: Happy families, Ann. Math. Logic\n                           12 (1977), 59\u2013111.","journal-title":"Ann. Math. Logic"},{"key":"3724_CR29","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jctb.2014.01.003","volume":"106","author":"A Pokrovskiy","year":"2014","unstructured":"A. Pokrovskiy: Partitioning edge-coloured complete graphs into monochromatic cycles and paths, Journal of Combinatorial Theory, Series B\n                           106 (2014), 70\u201397.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3724_CR30","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0167-5060(08)70507-7","volume":"3","author":"R Rado","year":"1978","unstructured":"R. Rado: Monochromatic paths in graphs, Ann. Discrete Math\n                           3 (1978), 191\u2013194.","journal-title":"Ann. Discrete Math"},{"key":"3724_CR31","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F P Ramsey","year":"1930","unstructured":"F. P. Ramsey: On a problem of formal logic, Proc. London Math. Soc., 2nd Ser. 30 (1930), 264\u2013286.","journal-title":"Proc. London Math. Soc"},{"key":"3724_CR32","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF02018596","volume":"3","author":"H Raynaud","year":"1973","unstructured":"H. Raynaud: Sur le circuit hamiltonien bi-color\u00e9 dans les graphes orient\u00e9s, Periodica Mathematica Hungarica\n                           3 (1973), 289\u2013297.","journal-title":"Periodica Mathematica Hungarica"},{"key":"3724_CR33","first-page":"399","volume":"260","author":"E Szemer\u00e9di","year":"1976","unstructured":"E. Szemer\u00e9di: Regular Partitions of Graphs, Colloques Internationaux C.N.R.S -Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes\n                           260 (1976), 399\u2013401.","journal-title":"Colloques Internationaux C.N.R.S -Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes"},{"key":"3724_CR34","first-page":"201","volume":"16","author":"Z Tuza","year":"1983","unstructured":"Z. Tuza: Ryser\u2019s conjecture on transversals of r-partite hypergraphs, Ars Combinatoria\n                           16 (1983), 201\u2013209.","journal-title":"Ars Combinatoria"},{"key":"3724_CR35","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF02761683","volume":"43","author":"E L Wimmers","year":"1982","unstructured":"E. L. Wimmers: The Shelah P-point independence theorem, Israel Journal of Mathematics\n                           43 (1982), 28\u201348.","journal-title":"Israel Journal of Mathematics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-018-3724-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-018-3724-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-018-3724-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T23:35:49Z","timestamp":1594164949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-018-3724-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,9]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["3724"],"URL":"https:\/\/doi.org\/10.1007\/s00493-018-3724-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,9]]},"assertion":[{"value":"17 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}