{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T13:38:51Z","timestamp":1775828331070,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642102165","type":"print"},{"value":"9783642102172","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_43","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"438-449","source":"Crossref","is-referenced-by-count":5,"title":["The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree"],"prefix":"10.1007","author":[{"given":"Edyta","family":"Szyma\u0144ska","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejc.2008.02.011","volume":"30","author":"R. Aharoni","year":"2009","unstructured":"Aharoni, R., Georgakopoulos, A., Spr\u00fcssel, P.: Perfect matchings in r-partite r-graphs. European. J. Combin.\u00a030(1), 39\u201342 (2009)","journal-title":"European. J. Combin."},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R. Aharoni","year":"2000","unstructured":"Aharoni, R., Haxell, P.: Hall\u2019s theorem for hypergraphs. J. Graph Theory\u00a035, 83\u201388 (2000)","journal-title":"J. Graph Theory"},{"issue":"2","key":"43_CR3","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\u00a066(2), 269\u2013282 (1996)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-85363-3_2","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Asadpour","year":"2008","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus Meets Hypergraph Matchings. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 10\u201320. Springer, Heidelberg (2008)"},{"key":"43_CR5","first-page":"63","volume":"32","author":"A. Czygrinow","year":"2001","unstructured":"Czygrinow, A., Nagle, B.: A note on a codegree problem for hypergraphs. Bulletin of ICA\u00a032, 63\u201369 (2001)","journal-title":"Bulletin of ICA"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canad J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Canad J. Math."},{"key":"43_CR7","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, New York (1979)"},{"issue":"2","key":"43_CR8","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1137\/080729657","volume":"23","author":"H. Han","year":"2009","unstructured":"Han, H., Person, Y., Schacht, M.: On perfect matchings in uniform hypergraphs with large minimum vertex degree. SIAM J. Discrete Math.\u00a023(2), 732\u2013748 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"P.E. Haxell","year":"1995","unstructured":"Haxell, P.E.: A Condition for Matchability in Hypergraphs. Graphs and Combinatorics\u00a011, 245\u2013248 (1995)","journal-title":"Graphs and Combinatorics"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"G.Y. Katona","year":"1999","unstructured":"Katona, G.Y., Kierstead, H.A.: Hamiltonian chains in hypergraphs. J. Graph Theory\u00a030, 205\u2013212 (1999)","journal-title":"J. Graph Theory"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, 83\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"43_CR12","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G., Hell, P.: On the Complexity of General Graph Factor Problems. SIAM J. Comput.\u00a012(3), 601\u2013609 (1983)","journal-title":"SIAM J. Comput."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"K\u00fchn, D., Osthus, D.: Critical chromatic number and the complexity of perfect packings in graphs. In: 17th ACM-SIAM SODA 2006, pp. 851\u2013859 (2006)","DOI":"10.1145\/1109557.1109651"},{"issue":"6","key":"43_CR14","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.jctb.2006.02.004","volume":"96","author":"D. K\u00fchn","year":"2006","unstructured":"K\u00fchn, D., Osthus, D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory, Ser. B\u00a096(6), 767\u2013821 (2006)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"43_CR15","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"4","key":"43_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00373-008-0787-7","volume":"24","author":"O. Pikhurko","year":"2008","unstructured":"Pikhurko, O.: Perfect matchings and $K_4^3$ -tilings in hypergraphs of large codegree. Graphs Combin.\u00a024(4), 391\u2013404 (2008)","journal-title":"Graphs Combin."},{"issue":"1-2","key":"43_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V. R\u00f6dl","year":"2006","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Dirac\u2019s theorem for 3-uniform hypergraphs. Combin. Probab. Comput.\u00a015(1-2), 229\u2013251 (2006)","journal-title":"Combin. Probab. Comput."},{"key":"43_CR18","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.jcta.2008.10.002","volume":"116","author":"V. R\u00f6dl","year":"2009","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory, Ser. A\u00a0116, 613\u2013636 (2009)","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"4","key":"43_CR19","first-page":"633","volume":"49","author":"V. R\u00f6dl","year":"2008","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Schacht, M., Szemer\u00e9di, E.: A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Commentationes Mathematicae Universitatis Carolinae\u00a049(4), 633\u2013636 (2008)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:52:19Z","timestamp":1606168339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}