{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144976,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T00:00:00Z","timestamp":1533513600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T00:00:00Z","timestamp":1533513600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-05-1-0257","H98230-08-1-0015"],"award-info":[{"award-number":["H98230-05-1-0257","H98230-08-1-0015"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["353292"],"award-info":[{"award-number":["353292"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-05-1-0079","H98230-07-1-0019"],"award-info":[{"award-number":["H98230-05-1-0079","H98230-07-1-0019"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1400073"],"award-info":[{"award-number":["1400073"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1929-1","type":"journal-article","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T13:21:28Z","timestamp":1533561688000},"page":"1049-1075","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tiling Tripartite Graphs with 3-Colorable Graphs: The Extreme Case"],"prefix":"10.1007","volume":"34","author":[{"given":"Kirsten","family":"Hogenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan R.","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,6]]},"reference":[{"issue":"2","key":"1929_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02350627","volume":"8","author":"N Alon","year":"1992","unstructured":"Alon, N., Yuster, R.: Almost $$H$$-factors in dense graphs. Graphs Combin. 8(2), 95\u2013102 (1992)","journal-title":"Graphs Combin."},{"issue":"2","key":"1929_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/jctb.1996.0020","volume":"66","author":"N Alon","year":"1996","unstructured":"Alon, N., Yuster, R.: $$H$$-factors in dense graphs. J. Combin. Theory Ser. B 66(2), 269\u2013282 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"unstructured":"Bollob\u00e1s, B.: Extremal graph theory. Dover Publications, Inc., Mineola, NY (2004). Reprint of the 1978 original","key":"1929_CR3"},{"issue":"1","key":"1929_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1002\/jgt.20605","volume":"70","author":"A Bush","year":"2012","unstructured":"Bush, A., Zhao, Y.: Minimum degree thresholds for bipartite graph tiling. J. Graph Theory 70(1), 92\u2013120 (2012)","journal-title":"J. Graph Theory"},{"key":"1929_CR5","first-page":"163","volume":"17","author":"P Catlin","year":"1980","unstructured":"Catlin, P.: On the Hajnal\u2013Szemer\u00e9di theorem on disjoint cliques. Utilitas Math. 17, 163\u2013177 (1980)","journal-title":"Utilitas Math."},{"key":"1929_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14, 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"2","key":"1929_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.jctb.2011.10.003","volume":"102","author":"B Csaba","year":"2012","unstructured":"Csaba, B., Mydlarz, M.: Approximate multipartite version of the Hajnal\u2013Szemer\u00e9di theorem. J. Combin. Theory Ser. B 102(2), 395\u2013410 (2012)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"1929_CR8","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1137\/100788203","volume":"25","author":"A Czygrinow","year":"2011","unstructured":"Czygrinow, A., DeBiasio, L.: A note on bipartite graph tiling. SIAM J. Discrete Math. 25(4), 1477\u20131489 (2011)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1929_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P Erd\u0151s","year":"1986","unstructured":"Erd\u0151s, P., Frankl, P., R\u00f6dl, V.: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin. 2(2), 113\u2013121 (1986)","journal-title":"Graphs Combin."},{"issue":"4","key":"1929_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<275::AID-JGT2>3.0.CO;2-F","volume":"31","author":"E Fischer","year":"1999","unstructured":"Fischer, E.: Variants of the Hajnal\u2013Szemer\u00e9di theorem. J. Graph Theory 31(4), 275\u2013282 (1999)","journal-title":"J. Graph Theory"},{"unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u0151s. In: Combinatorial theory and its applications, II (Proc. Colloq., Balatonf\u00fcred, 1969), pp. 601\u2013623. North-Holland, Amsterdam (1970)","key":"1929_CR11"},{"issue":"10","key":"1929_CR12","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/j.disc.2013.02.008","volume":"313","author":"J Han","year":"2013","unstructured":"Han, J., Zhao, Y.: On multipartite Hajnal\u2013Szemer\u00e9di theorems. Discrete Math. 313(10), 1119\u20131129 (2013)","journal-title":"Discrete Math."},{"issue":"2","key":"1929_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/080726434","volume":"24","author":"J Hladk\u00fd","year":"2010","unstructured":"Hladk\u00fd, J., Schacht, M.: Note on bipartite graph tilings. SIAM J. Discrete Math. 24(2), 357\u2013362 (2010)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Keevash, P., Mycroft, R.: A geometric theory for hypergraph matching. Mem. Amer. Math. Soc. 233(1098), vi+95 (2015)","key":"1929_CR14","DOI":"10.1090\/memo\/1098"},{"key":"1929_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jctb.2015.04.003","volume":"114","author":"P Keevash","year":"2015","unstructured":"Keevash, P., Mycroft, R.: A multipartite Hajnal\u2013Szemer\u00e9di theorem. J. Combin. Theory Ser. B 114, 187\u2013236 (2015)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1929_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004930070020","volume":"20","author":"J Koml\u00f3s","year":"2000","unstructured":"Koml\u00f3s, J.: Tiling Tur\u00e1n theorems. Combinatorica 20(2), 203\u2013218 (2000)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G., Szemer\u00e9di, E.: Proof of the Alon\u2013Yuster conjecture. Discrete Math. 235(1\u20133), 255\u2013269 (2001) (Combinatorics (Prague, 1998))","key":"1929_CR17","DOI":"10.1016\/S0012-365X(00)00279-X"},{"doi-asserted-by":"crossref","unstructured":"K\u00fchn, D., Osthus, D.: Embedding large subgraphs into dense graphs. In: Surveys in combinatorics 2009, London Math. Soc. Lecture Note Ser., vol. 365, pp. 137\u2013167. Cambridge Univ. Press, Cambridge (2009)","key":"1929_CR18","DOI":"10.1017\/CBO9781107325975.007"},{"issue":"1","key":"1929_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00493-009-2254-3","volume":"29","author":"D K\u00fchn","year":"2009","unstructured":"K\u00fchn, D., Osthus, D.: The minimum degree threshold for perfect graph packings. Combinatorica 29(1), 65\u2013107 (2009)","journal-title":"Combinatorica"},{"issue":"1","key":"1929_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1017\/S096354831200048X","volume":"22","author":"A Lo","year":"2013","unstructured":"Lo, A., Markstr\u00f6m, K.: A multipartite version of the Hajnal\u2013Szemer\u00e9di theorem for graphs and hypergraphs. Combin. Probab. Comput. 22(1), 97\u2013111 (2013)","journal-title":"Combin. Probab. Comput."},{"issue":"1\u20133","key":"1929_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00373-9","volume":"254","author":"C Magyar","year":"2002","unstructured":"Magyar, C., Martin, R.: Tripartite version of the Corr\u00e1di\u2013Hajnal theorem. Discrete Math. 254(1\u20133), 289\u2013308 (2002)","journal-title":"Discrete Math."},{"key":"1929_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jctb.2017.05.004","volume":"127","author":"RR Martin","year":"2017","unstructured":"Martin, R.R., Skokan, J.: Asymptotic multipartite version of the Alon\u2013Yuster theorem. J. Combin. Theory Ser. B. 127, 32\u201352 (2017)","journal-title":"J. Combin. Theory Ser. B."},{"issue":"19","key":"1929_CR23","doi-asserted-by":"publisher","first-page":"4337","DOI":"10.1016\/j.disc.2007.08.019","volume":"308","author":"R Martin","year":"2008","unstructured":"Martin, R., Szemer\u00e9di, E.: Quadripartite version of the Hajnal\u2013Szemer\u00e9di theorem. Discrete Math. 308(19), 4337\u20134360 (2008)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Martin, R., Zhao, Y.: Tiling tripartite graphs with 3-colorable graphs. Electron. J. Combin. 16(1), 109 (2009) (Research Paper)","key":"1929_CR24","DOI":"10.37236\/198"},{"issue":"2","key":"1929_CR25","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1002\/rsa.10091","volume":"23","author":"A Shokoufandeh","year":"2003","unstructured":"Shokoufandeh, A., Zhao, Y.: Proof of a tiling conjecture of Koml\u00f3s. Random Struct. Algorithms 23(2), 180\u2013205 (2003)","journal-title":"Random Struct. Algorithms"},{"unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS, vol. 260, pp. 399\u2013401. CNRS, Paris (1978)","key":"1929_CR26"},{"issue":"1\u20133","key":"1929_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0012-365X(97)00236-7","volume":"187","author":"H Wang","year":"1998","unstructured":"Wang, H.: Vertex-disjoint hexagons with chords in a bipartite graph. Discrete Math. 187(1\u20133), 221\u2013231 (1998)","journal-title":"Discrete Math."},{"issue":"2","key":"1929_CR28","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/060665397","volume":"23","author":"Y Zhao","year":"2009","unstructured":"Zhao, Y.: Bipartite graph tiling. SIAM J. Discrete Math. 23(2), 888\u2013900 (2009)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1929-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1929-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1929-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:55:19Z","timestamp":1589446519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1929-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,6]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1929"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1929-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,8,6]]},"assertion":[{"value":"17 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}