{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:36:29Z","timestamp":1700613389121},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"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":[[2022,12]]},"DOI":"10.1007\/s00493-020-4640-9","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T13:03:41Z","timestamp":1652965421000},"page":"771-819","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Short Proof of the Blow-Up Lemma for Approximate Decompositions"],"prefix":"10.1007","volume":"42","author":[{"given":"Stefan","family":"Ehard","sequence":"first","affiliation":[]},{"given":"Felix","family":"Joos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"4640_CR1","unstructured":"P. Allen, J. B\u00f6ttcher, D. Clemens, J. Hladk\u00fd, D. Piguet and A. Taraz: The tree packing conjecture for trees of almost linear maximum degree, arXiv:2106.11720 (2021)."},{"key":"4640_CR2","unstructured":"P. Allen, J. B\u00f6ttcher, D. Clemens and A. Taraz: Perfectly packing graphs with bounded degeneracy and many leaves, Israel J. Math., to appear"},{"key":"4640_CR3","unstructured":"P. Allen, J. B\u00f6ttcher, H. H\u00e0n, Y. Kohayakawa and Y. Person: Blow-up lemmas for sparse graphs, arXiv:1612.00622 (2016)."},{"key":"4640_CR4","doi-asserted-by":"publisher","first-page":"106739","DOI":"10.1016\/j.aim.2019.106739","volume":"354","author":"P Allen","year":"2019","unstructured":"P. Allen, J. B\u00f6ttcher, J. Hladk\u00fd and D. Piguet: Packing degenerate graphs, Adv. Math. 354 (2019), 106739.","journal-title":"Adv. Math."},{"key":"4640_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11856-015-1277-2","volume":"211","author":"J B\u00f6ttcher","year":"2016","unstructured":"J. B\u00f6ttcher, J. Hladk\u00fd, D. Piguet and A. Taraz: An approximate version of the tree packing conjecture, Israel J. Math. 211 (2016), 391\u2013446.","journal-title":"Israel J. Math."},{"key":"4640_CR6","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1112\/plms.12218","volume":"118","author":"P Condon","year":"2019","unstructured":"P. Condon, J. Kim, D. K\u00fchn and D. Osthus: A bandwidth theorem for approximate decompositions, Proc. Lond. Math. Soc. 118 (2019), 1393\u20131449.","journal-title":"Proc. Lond. Math. Soc."},{"key":"4640_CR7","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0097539793247634","volume":"24","author":"R A Duke","year":"1995","unstructured":"R. A. Duke, H. Lefmann and V. R\u00f6dl: A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. Comput. 24 (1995), 598\u2013620.","journal-title":"SIAM J. Comput."},{"key":"4640_CR8","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1017\/S0963548320000280","volume":"29","author":"S Ehard","year":"2020","unstructured":"S. Ehard, S. Glock and F. Joos: Pseudorandom hypergraph matchings, Combin. Probab. Comput. 29 (2020), 868\u2013885.","journal-title":"Combin. Probab. Comput."},{"key":"4640_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1017\/fms.2020.38","volume":"8","author":"S Ehard","year":"2020","unstructured":"S. Ehard, S. Glock and F. Joos: A rainbow blow-up lemma for almost optimally bounded edge-colourings, Forum Math. Sigma 8 (2020), Paper No. e37, 32.","journal-title":"Forum Math. Sigma"},{"key":"4640_CR10","unstructured":"S. Ehard and F. Joos: Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, arXiv:2011.05359 (2020)."},{"key":"4640_CR11","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s11856-017-1504-0","volume":"219","author":"A Ferber","year":"2017","unstructured":"A. Ferber, C. Lee and F. Mousset: Packing spanning graphs from separable families, Israel J. Math. 219 (2017), 959\u2013982.","journal-title":"Israel J. Math."},{"key":"4640_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1112\/jlms.12179","volume":"99","author":"A Ferber","year":"2019","unstructured":"A. Ferber and W. Samotij: Packing trees of unbounded degrees in random graphs, J. Lond. Math. Soc. 99 (2019), 653\u2013677.","journal-title":"J. Lond. Math. Soc."},{"key":"4640_CR13","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1002\/rsa.20907","volume":"56","author":"S Glock","year":"2020","unstructured":"S. Glock and F. Joos: A rainbow blow-up lemma, Random Structures Algorithms 56 (2020), 1031\u20131069.","journal-title":"Random Structures Algorithms"},{"key":"4640_CR14","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.4171\/JEMS\/1060","volume":"23","author":"S Glock","year":"2021","unstructured":"S. Glock, F. Joos, J. Kim, D. K\u00fchn and D. Osthus: Resolution of the Oberwolfach problem, J. Eur. Math. Soc. 23 (2021), 2511\u20132547.","journal-title":"J. Eur. Math. Soc."},{"key":"4640_CR15","unstructured":"S. Glock, D. K\u00fchn, A. Lo and D. Osthus: The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F, Mem. Amer. Math. Soc. (to appear)."},{"key":"4640_CR16","doi-asserted-by":"publisher","first-page":"3573","DOI":"10.4171\/JEMS\/909","volume":"21","author":"F Joos","year":"2019","unstructured":"F. Joos, J. Kim, D. K\u00fchn and D. Osthus: Optimal packings of bounded degree trees, J. Eur. Math. Soc. 21 (2019), 3573\u20133647.","journal-title":"J. Eur. Math. Soc."},{"issue":"3","key":"4640_CR17","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/rsa.20362","volume":"39","author":"P Keevash","year":"2011","unstructured":"P. Keevash: A hypergraph blow-up lemma, Random Structures Algorithms 39 (2011), no. 3, 275\u2013376.","journal-title":"Random Structures Algorithms"},{"key":"4640_CR18","unstructured":"P. Keevash: The existence of designs, arXiv:1401.3665 (2014)."},{"key":"4640_CR19","unstructured":"P. Keevash: The existence of designs II, arXiv:1802.05900 (2018)."},{"key":"4640_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.jctb.2021.09.007","volume":"152","author":"P Keevash","year":"2022","unstructured":"P. Keevash and K. Staden: The generalised Oberwolfach problem, J. Combin. Theory Ser. B 152 (2022), 281\u2013318.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4640_CR21","unstructured":"P. Keevash and K. Staden: Ringel\u2019s tree packing conjecture in quasirandom graphs, arXiv:2004.09947 (2020)."},{"key":"4640_CR22","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1002\/rsa.20913","volume":"57","author":"J Kim","year":"2020","unstructured":"J. Kim, Y. Kim and H. Lui: Tree decompositions of graphs without large bipartite holes, Random Structures Algorithms 57 (2020), 150\u2013168.","journal-title":"Random Structures Algorithms"},{"key":"4640_CR23","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1002\/rsa.20902","volume":"56","author":"J Kim","year":"2020","unstructured":"J. Kim, D. K\u00fchn, A. Kupavskii and D. Osthus: Rainbow structures in locally bounded colourings of graphs, Random Structures Algorithms 56 (2020), 1171\u20131204.","journal-title":"Random Structures Algorithms"},{"key":"4640_CR24","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1090\/tran\/7411","volume":"371","author":"J Kim","year":"2019","unstructured":"J. Kim, D. K\u00fchn, D. Osthus and M. Tyomkyn: A blow-up lemma for approximate decompositions, Trans. Amer. Math. Soc. 371 (2019), 4655\u20134742.","journal-title":"Trans. Amer. Math. Soc."},{"key":"4640_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Blow-up lemma, Combinatorica 17 (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"4640_CR26","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1017\/S0963548318000421","volume":"28","author":"D Kr\u00e1l\u2019","year":"2019","unstructured":"D. Kr\u00e1l\u2019, B. Lidick\u00fd, T. Martins and Y. Pehova: Decomposing graphs into edges and triangles, Combin. Probab. Comput. 28 (2019), 465\u2013472.","journal-title":"Combin. Probab. Comput."},{"key":"4640_CR27","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.aim.2013.01.005","volume":"237","author":"D K\u00fchn","year":"2013","unstructured":"D. K\u00fchn and D. Osthus: Hamilton decompositions of regular expanders: A proof of Kelly\u2019s conjecture for large tournaments, Adv. Math. 237 (2013), 62\u2013146.","journal-title":"Adv. Math."},{"key":"4640_CR28","doi-asserted-by":"crossref","unstructured":"C. McDiarmid: On the method of bounded differences, Surveys in combinatorics, 1989 (Norwich, 1989), London Math. Soc. Lecture Note Ser., vol. 141, Cambridge Univ. Press, 1989, 148\u2013188.","DOI":"10.1017\/CBO9781107359949.008"},{"key":"4640_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jctb.2016.03.003","volume":"119","author":"S Messuti","year":"2016","unstructured":"S. Messuti, V. R\u00f6dl and M. Schacht: Packing minor-closed families of graphs into complete graphs, J. Combin. Theory Ser. B 119 (2016), 245\u2013265.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4640_CR30","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.4171\/JEMS\/982","volume":"22","author":"R Montgomery","year":"2020","unstructured":"R. Montgomery, A. Pokrovskiy and B. Sudakov: Embedding rainbow trees with applications to graph labelling and decomposition, J. Eur. Math. Soc. 22 (2020), 3101\u20133132.","journal-title":"J. Eur. Math. Soc."},{"key":"4640_CR31","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00039-021-00576-2","volume":"31","author":"R Montgomery","year":"2021","unstructured":"R. Montgomery, A. Pokrovskiy and B. Sudakov: A proof of Ringel\u2019s Conjecture, Geom. Funct. Anal. 31 (2021), 663\u2013720.","journal-title":"Geom. Funct. Anal."},{"key":"4640_CR32","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s004930050063","volume":"19","author":"V R\u00f6dl","year":"1999","unstructured":"V. R\u00f6dl and A. Ruci\u0144ski; Perfect matchings in \u03f5-regular graphs and the blow-up lemma, Combinatorica 19 (1999), 437\u2013452.","journal-title":"Combinatorica"},{"key":"4640_CR33","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0097-3165(72)90028-3","volume":"13","author":"R M Wilson","year":"1972","unstructured":"R. M. Wilson: An existence theory for pairwise balanced designs I. Composition theorems and morphisms, J. Combin. Theory Ser. A 13 (1972), 220\u2013245.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4640_CR34","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0097-3165(72)90029-5","volume":"13","author":"R M Wilson","year":"1972","unstructured":"R. M. Wilson: An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjectures, J. Combin. Theory Ser. A 13 (1972), 246\u2013273.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4640_CR35","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0097-3165(75)90067-9","volume":"18","author":"R M Wilson","year":"1975","unstructured":"R. M. Wilson: An existence theory for pairwise balanced designs III. Proof of the existence conjectures, J. Combin. Theory Ser. A 18 (1975), 71\u201379.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4640-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4640-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-4640-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T21:52:55Z","timestamp":1700603575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4640-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4640"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4640-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"17 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}