{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T13:38:50Z","timestamp":1775828330612,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00493-009-2254-3","type":"journal-article","created":{"date-parts":[[2009,5,8]],"date-time":"2009-05-08T06:57:01Z","timestamp":1241765821000},"page":"65-107","source":"Crossref","is-referenced-by-count":94,"title":["The minimum degree threshold for perfect graph packings"],"prefix":"10.1007","volume":"29","author":[{"given":"Daniela","family":"K\u00fchn","sequence":"first","affiliation":[]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,9]]},"reference":[{"key":"2254_CR1","unstructured":"S. Abbasi: The solution of the El-Zahar problem, Ph.D. Thesis, Rutgers University, 1998."},{"key":"2254_CR2","first-page":"296","volume":"52","author":"N. Alon","year":"1999","unstructured":"N. Alon and E. Fischer: Refining the graph density condition for the existence of almost K-factors, Ars Combinatorica 52 (1999), 296\u2013308.","journal-title":"Ars Combinatorica"},{"key":"2254_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jctb.1996.0020","volume":"66","author":"N. Alon","year":"1996","unstructured":"N. Alon and R. Yuster: H-factors in dense graphs, J. Combin. Theory B 66 (1996), 269\u2013282.","journal-title":"J. Combin. Theory B"},{"key":"2254_CR4","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s: Modern Graph Theory, Graduate Texts in Mathematics 184, Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"2254_CR5","unstructured":"O. Cooley: Embedding problems for graphs and hypergraphs, M. Phil. Thesis, Birmingham University, 2006."},{"key":"2254_CR6","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1016\/j.ejc.2007.04.002","volume":"28","author":"O. Cooley","year":"2007","unstructured":"O. Cooley, D. K\u00fchn and D. Osthus: Perfect packings with complete graphs minus an edge, Europ. J. Combin. 28 (2007), 2143\u20132155.","journal-title":"Europ. J. Combin."},{"key":"2254_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\u00e1di","year":"1963","unstructured":"K. Corr\u00e1di and A. Hajnal: On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423\u2013439.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2254_CR8","doi-asserted-by":"crossref","unstructured":"R. Diestel: Graph Theory (3rd edition), Graduate Texts in Mathematics 173, Springer-Verlag, 2005.","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"2254_CR9","series-title":"Colloq. Math. Soc. J. Bolyai","first-page":"601","volume-title":"Combinatorial Theory and its Applications (Vol. 2)","author":"A. Hajnal","year":"1970","unstructured":"A. Hajnal and E. Szemer\u00e9di: Proof of a conjecture of Erd\u0151s, Combinatorial Theory and its Applications (Vol. 2), (P. Erd\u0151s, A. R\u00e9nyi and V. T. S\u00f3s eds.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam (1970), 601\u2013623."},{"key":"2254_CR10","first-page":"273","volume":"25","author":"P. Hell","year":"1978","unstructured":"P. Hell and D. G. Kirkpatrick: Scheduling, matching and colouring; Colloquia Math. Soc. Bolyai 25 (1978), 273\u2013279.","journal-title":"Colloquia Math. Soc. Bolyai"},{"key":"2254_CR11","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"P. Hell","year":"1983","unstructured":"P. Hell and D. G. Kirkpatrick: On the complexity of general graph factor problems, SIAM J. Computing 12 (1983), 601\u2013609.","journal-title":"SIAM J. Computing"},{"key":"2254_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(94)90105-8","volume":"49","author":"V. Kann","year":"1994","unstructured":"V. Kann: Maximum bounded H-matching is MAX SNP-complete, Information Processing Letters 49 (1994), 309\u2013318.","journal-title":"Information Processing Letters"},{"key":"2254_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/jgt.10007","volume":"39","author":"K. Kawarabayashi","year":"2002","unstructured":"K. Kawarabayashi: K 4 \u2212 -factors in a graph, J. Graph Theory 39 (2002), 111\u2013128.","journal-title":"J. Graph Theory"},{"key":"2254_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0963548398003502","volume":"8","author":"J. Koml\u00f3s","year":"1999","unstructured":"J. Koml\u00f3s: The Blow-up lemma, Comb. Probab. Comput. 8 (1999), 161\u2013176.","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"2254_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s004930070020","volume":"20","author":"J. Koml\u00f3s","year":"2000","unstructured":"J. Koml\u00f3s: Tiling Tur\u00e1n theorems, Combinatorica 20(2) (2000), 203\u2013218.","journal-title":"Combinatorica"},{"issue":"1","key":"2254_CR16","doi-asserted-by":"crossref","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(1) (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"2254_CR17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(00)00279-X","volume":"235","author":"J. Koml\u00f3s","year":"2001","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Proof of the Alon-Yuster conjecture, Discrete Math. 235 (2001), 255\u2013269.","journal-title":"Discrete Math."},{"key":"2254_CR18","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), (D. Mikl\u00f3s, V. T. S\u00f3s and T. Sz\u0151nyi eds.), Budapest (1996), 295\u2013352."},{"key":"2254_CR19","doi-asserted-by":"crossref","unstructured":"D. K\u00fchn and D. Osthus: Critical chromatic number and complexity of perfect packings in graphs, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), 851\u2013859.","DOI":"10.1145\/1109557.1109651"},{"key":"2254_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.jctb.2005.04.004","volume":"95","author":"D. K\u00fchn","year":"2005","unstructured":"D. K\u00fchn, D. Osthus and A. Taraz: Large planar subgraphs in dense graphs, J. Combin. Theory B 95 (2005), 263\u2013282.","journal-title":"J. Combin. Theory B"},{"key":"2254_CR21","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/rsa.10091","volume":"23","author":"A. Shokoufandeh","year":"2003","unstructured":"A. Shokoufandeh and Y. Zhao: Proof of a conjecture of Koml\u00f3s, Random Struct. Alg. 23 (2003), 180\u2013205.","journal-title":"Random Struct. Alg."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2254-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2254-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2254-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:46Z","timestamp":1559093566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2254-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["2254"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2254-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}