{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T03:09:22Z","timestamp":1692587362527},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:00:00Z","timestamp":1618963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:00:00Z","timestamp":1618963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00493-020-4292-9","type":"journal-article","created":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T07:06:31Z","timestamp":1618988791000},"page":"319-352","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Matija","family":"Buci\u0107","sequence":"first","affiliation":[]},{"given":"D\u00e1niel","family":"Kor\u00e1ndi","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,21]]},"reference":[{"key":"4292_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcta.2018.07.011","volume":"161","author":"A Abu-Khazneh","year":"2019","unstructured":"A. Abu-Khazneh, J. Bar\u00e1t, A. Pokrovskiy and T. Szab\u00f3: A family of extremal hypergraphs for Ryser\u2019s conjecture, J. Combin. Theory Ser. A 161 (2019), 164\u2013177.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4292_CR2","first-page":"81","volume":"103","author":"A Abu-Khazneh","year":"2017","unstructured":"A. Abu-Khazneh and A. Pokrovskiy: Intersecting extremal constructions in Ryser\u2019s conjecture for r-partite hypergraphs, J. Combin. Math. Combin. Comput. 103 (2017), 81\u2013104.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"4292_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004930170001","volume":"21","author":"R Aharoni","year":"2001","unstructured":"R. Aharoni: Ryser\u2019s conjecture for tripartite 3-graphs, Combinatorica 21 (2001), 1\u20134.","journal-title":"Combinatorica"},{"key":"4292_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-015-1575-9","volume":"32","author":"R Aharoni","year":"2016","unstructured":"R. Aharoni, J. Bar\u00e1t and I. M. Wanless: Multipartite hypergraphs achieving equality in Ryser\u2019s conjecture, Graphs Combin. 32 (2016), 1\u201315.","journal-title":"Graphs Combin."},{"key":"4292_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0097-3165(85)90048-2","volume":"40","author":"N Alon","year":"1985","unstructured":"N. Alon: An extremal problem for sets with applications to graph theory, J. Combin. Theory Ser. A 40 (1985), 82\u201389.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4292_CR6","series-title":"Wiley Series in Discrete Mathematics and Optimization","volume-title":"The probabilistic method","author":"N Alon","year":"2016","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, fourth ed., Wiley Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2016.","edition":"fourth ed."},{"key":"4292_CR7","doi-asserted-by":"publisher","first-page":"P1.18","DOI":"10.37236\/6089","volume":"24","author":"D Bal","year":"2017","unstructured":"D. Bal and L. DeBiasio: Partitioning random graphs into monochromatic components, Electron. J. Combin. 24 (2017), P1.18.","journal-title":"Electron. J. Combin."},{"key":"4292_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ejc.2018.10.001","volume":"76","author":"P Bennett","year":"2019","unstructured":"P. Bennett, L. DeBiasio, A. Dudek and S. English: Large monochromatic components and long monochromatic cycles in random hypergraphs, European J. Combin. 76 (2019), 123\u2013137.","journal-title":"European J. Combin."},{"key":"4292_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B Bollob\u00e1s","year":"1965","unstructured":"B. Bollob\u00e1s: On generalized graphs, Acta Math. Acad. Sci. Hungar. 16 (1965), 447\u2013452.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"4292_CR10","unstructured":"B. Bollob\u00e1s: Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability, Cambridge University Press, 1986."},{"key":"4292_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.4007\/annals.2016.184.2.2","volume":"2","author":"D Conlon","year":"2016","unstructured":"D. Conlon and W. T. Gowers: Combinatorial theorems in sparse random sets, Ann. of Math. 2 (2016), 367\u2013454.","journal-title":"Ann. of Math."},{"key":"4292_CR12","doi-asserted-by":"crossref","unstructured":"L. Danzer, B. Gr\u00fcnbaum and V. Klee: Helly\u2019s theorem and its relatives, in: Proc. Sympos. Pure Math., Vol. VII, Amer. Math. Soc., Providence, R.I., 101\u2013180, 1963.","DOI":"10.1090\/pspum\/007\/0157289"},{"key":"4292_CR13","first-page":"82","volume":"2","author":"P Erd\u0151s","year":"1992","unstructured":"P. Erd\u0151s, D. G. Fon-Der-Flaass, A. V. Kostochka and Zs. Tuza: Small transversals in uniform hypergraphs, Siberian Advances in Math. 2 (1992), 82\u201388.","journal-title":"Siberian Advances in Math"},{"key":"4292_CR14","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, J. Combin. Theory Ser. B 51 (1991), 90\u201395.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4292_CR15","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s, A. Hajnal and J. W. Moon: A problem in graph theory, Amer. Math. Monthly 71 (1964), 1107\u20131110.","journal-title":"Amer. Math. Monthly"},{"key":"4292_CR16","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0097-3165(91)90074-Q","volume":"58","author":"P Erd\u0151s","year":"1991","unstructured":"P. Erd\u0151s, A. Hajnal and Zs. Tuza: Local constraints ensuring small representing sets, J. Combin. Theory, Ser. A 58 (1991), 78\u201384.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"4292_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0012-365X(99)00114-4","volume":"207","author":"D G Fon-Der-Flaass","year":"1999","unstructured":"D. G. Fon-Der-Flaass, A. V. Kostochka and D. R. Woodall: Transversals in uniform hypergraphs with property (7,2), Discrete Math. 207 (1999), 277\u2013284.","journal-title":"Discrete Math."},{"key":"4292_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejc.2016.10.004","volume":"61","author":"N Franceti\u0107","year":"2017","unstructured":"N. Franceti\u0107, S. Herke, B. D. McKay and I. M. Wanless: On Ryser\u2019s conjecture for linear intersecting multipartite hypergraphs, European J. Combin. 61 (2017), 91\u2013105.","journal-title":"European J. Combin."},{"key":"4292_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z F\u00fcredi","year":"1988","unstructured":"Z. F\u00fcredi: Matchings and covers in hypergraphs, Graphs Combin. 4 (1988), 115\u2013206.","journal-title":"Graphs Combin."},{"key":"4292_CR20","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. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math. 10 (1967), 167\u2013170.","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"4292_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/jgt.22435","volume":"91","author":"A Gir\u00e3o","year":"2019","unstructured":"A. Gir\u00e3o, S. Letzter and J. Sahasrabudhe: Partitioning a graph into monochromatic connected subgraphs, J. Graph Theory 91 (2019), 353\u2013364.","journal-title":"J. Graph Theory"},{"key":"4292_CR22","first-page":"89","volume-title":"Irregularities of partitions (Fert\u0151d, 1986), Algorithms Combin. Study Res. Texts","author":"A Gy\u00e1rf\u00e1s","year":"1989","unstructured":"A. Gy\u00e1rf\u00e1s: Covering complete graphs by monochromatic paths, in: Irregularities of partitions (Fert\u0151d, 1986), Algorithms Combin. Study Res. Texts, vol. 8, Springer, Berlin, 89\u201391, 1989."},{"key":"4292_CR23","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1016\/j.disc.2015.07.007","volume":"339","author":"A Gy\u00e1rf\u00e1s","year":"2016","unstructured":"A. Gy\u00e1rf\u00e1s: Vertex covers by monochromatic pieces-a survey of results and problems, Discrete Mathematics 339 (2016), 1970\u20131977.","journal-title":"Discrete Mathematics"},{"key":"4292_CR24","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":"A. Gy\u00e1rf\u00e1s, M. Ruszink\u00f3, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: An improved bound for the monochromatic cycle partition number, J. Combin. Theory Ser. B 96 (2006), 855\u2013873.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4292_CR25","doi-asserted-by":"publisher","first-page":"P23","DOI":"10.37236\/1175","volume":"19","author":"P E Haxell","year":"2012","unstructured":"P. E. Haxell and A. D. Scott: On Ryser\u2019s conjecture, Electron. J. Combin. 19 (2012), P23.","journal-title":"Electron. J. Combin."},{"key":"4292_CR26","doi-asserted-by":"publisher","first-page":"P3.26","DOI":"10.37236\/6460","volume":"24","author":"P E Haxell","year":"2017","unstructured":"P. E. Haxell and A. D. Scott: A note on intersecting hypergraphs with large cover number, Electron. J. Combin. 24 (2017), P3.26.","journal-title":"Electron. J. Combin."},{"key":"4292_CR27","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"E. Helly: \u00dcber mengen konvexer k\u00f6rper mit gemeinschaftlichen punkte., Jahresbericht der Deutschen Mathematiker-Vereinigung 32 (1923), 175\u2013176.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"4292_CR28","unstructured":"J. R. Henderson: Permutation decomposition of (0, 1)-matrices and decomposition transversals, Ph.D. thesis, California Institute of Technology, 1971."},{"key":"4292_CR29","doi-asserted-by":"crossref","unstructured":"Y. Kohayakawa, G. O. Mota and M. Schacht: Monochromatic trees in random graphs, in: Mathematical Proceedings of the Cambridge Philosophical Society, Cambridge University Press, 1\u201318, 2018.","DOI":"10.1017\/S0305004117000846"},{"key":"4292_CR30","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jctb.2020.07.005","volume":"146","author":"D Kor\u00e1ndi","year":"2021","unstructured":"D. Kor\u00e1ndi, R. Lang, S. Letzter and A. Pokrovskiy: Minimum degree conditions for monochromatic cycle partitioning, J. Combin. Theory Ser. B 146 (2021), 96\u2013123.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4292_CR31","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1002\/rsa.20819","volume":"53","author":"D Korandi","year":"2018","unstructured":"D. Korandi, F. Mousset, R. Nenadov, N. Skoric and B. Sudakov: Monochromatic cycle covers in random graphs, Random Structures Algorithms 53 (2018), 667\u2013691.","journal-title":"Random Structures Algorithms"},{"key":"4292_CR32","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004930200013","volume":"22","author":"A Kostochka","year":"2002","unstructured":"A. Kostochka: Transversals in uniform hypergraphs with property (p, 2), Combinatorica 22 (2002), 275\u2013285.","journal-title":"Combinatorica"},{"key":"4292_CR33","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1017\/S0963548320000401","volume":"30","author":"R Lang","year":"2021","unstructured":"R. Lang and A. Lo: Monochromatic cycle partitions in random graphs, Comb. Prob. Comput. 30 (2021), 136\u2013152.","journal-title":"Comb. Prob. Comput."},{"key":"4292_CR34","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0304-0208(08)73416-9","volume":"75","author":"J Lehel","year":"1983","unstructured":"J. Lehel: \u03c4-critical hypergraphs and the Helly property, in: Combinatorial mathematics (Marseille-Luminy, 1981), North-Holland Math. Stud., vol. 75, North-Holland, Amsterdam, 413\u2013418, 1983.","journal-title":"Combinatorial mathematics (Marseille-Luminy, 1981), North-Holland Math. Stud."},{"key":"4292_CR35","first-page":"209","volume":"26","author":"L Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz: On minimax theorems of combinatorics, Mat. Lapok 26 (1975), 209\u2013264 (1978).","journal-title":"Mat. Lapok"},{"key":"4292_CR36","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz: On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383\u2013390.","journal-title":"Discrete Math."},{"key":"4292_CR37","volume-title":"Combinatorial problems and exercises","author":"L Lov\u00e1sz","year":"1993","unstructured":"L. Lov\u00e1sz: Combinatorial problems and exercises, second ed., North-Holland Publishing Co., Amsterdam, 1993.","edition":"second ed."},{"key":"4292_CR38","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.jctb.2014.08.004","volume":"111","author":"G Moshkovitz","year":"2015","unstructured":"G. Moshkovitz and A. Shapira: Exact bounds for some hypergraph saturation problems, J. Combin. Theory Ser. B 111 (2015), 242\u2013248.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4292_CR39","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, J. Combin. Theory Ser. B 106 (2014), 70\u201397.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4292_CR40","doi-asserted-by":"publisher","first-page":"333","DOI":"10.4007\/annals.2016.184.2.1","volume":"2","author":"M Schacht","year":"2016","unstructured":"M. Schacht: Extremal results for random discrete structures, Ann. of Math. 2 (2016), 333\u2013365.","journal-title":"Ann. of Math."},{"key":"4292_CR41","unstructured":"Z. Tuza: On the order of vertex sets meeting all edges of a 3-partite hypergraph, in: Proceedings of the First Catania International Combinatorial Conference on Graphs, Steiner Systems, and their Applications, Vol. 1 (Catania, 1986), vol. 24 A, 59\u201363, 1987."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4292-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4292-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4292-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T06:05:22Z","timestamp":1625724322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4292-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,21]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["4292"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4292-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,21]]},"assertion":[{"value":"9 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}