{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:46:05Z","timestamp":1772448365784,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1145\/2488608.2488647","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"311-320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial-time perfect matchings in dense hypergraphs"],"prefix":"10.1145","author":[{"given":"Peter","family":"Keevash","sequence":"first","affiliation":[{"name":"Queen Mary, University of London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fiachra","family":"Knox","sequence":"additional","affiliation":[{"name":"Queen Mary, University of London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mycroft","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2008.02.011"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.02.004"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_3_2_1_6_1","volume-title":"Complexity of Computer Computations","author":"Karp M.","year":"1972","unstructured":". M. Karp , Reducibility among combinatorial problems , Complexity of Computer Computations ( 1972 ), 85--103. . M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations (1972), 85--103."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_64"},{"key":"e_1_3_2_1_8_1","unstructured":". Keevash and R. Mycroft A geometric theory for hypergraph matchings arXiv:1108.1757.  . Keevash and R. Mycroft A geometric theory for hypergraph matchings arXiv:1108.1757."},{"key":"e_1_3_2_1_9_1","unstructured":". Khan Perfect matching in 3-uniform hypergraphs with large vertex degree arXiv:1101.5830.  . Khan Perfect matching in 3-uniform hypergraphs with large vertex degree arXiv:1101.5830."},{"key":"e_1_3_2_1_10_1","unstructured":". Khan Perfect Matchings in 4-uniform hypergraphs arXiv:1101.5675.  . Khan Perfect Matchings in 4-uniform hypergraphs arXiv:1101.5675."},{"key":"e_1_3_2_1_11_1","unstructured":". Lo and K. Markstr\u00f6m Perfect matchings in 3-partite 3-uniform hypergraphs arXiv:1103.5654.  . Lo and K. Markstr\u00f6m Perfect matchings in 3-partite 3-uniform hypergraphs arXiv:1103.5654."},{"key":"e_1_3_2_1_12_1","volume-title":"An Irregular Mind (Szemer\u00e9di is 70) 21","author":"Rucinski A.","year":"2010","unstructured":". R\u00f6dl and A. Rucinski , Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve) , An Irregular Mind (Szemer\u00e9di is 70) 21 ( 2010 ), 1--30. . R\u00f6dl and A. Rucinski, Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve), An Irregular Mind (Szemer\u00e9di is 70) 21 (2010), 1--30."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.05.008"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.10.002"},{"key":"e_1_3_2_1_15_1","volume-title":"Probl\u00e8mes combinatoires et th\u00e9orie des graphes","year":"1978","unstructured":". Szemer\u00e9di , Regular partitions of graphs , Probl\u00e8mes combinatoires et th\u00e9orie des graphes ( 1978 ), 399--401. . Szemer\u00e9di, Regular partitions of graphs, Probl\u00e8mes combinatoires et th\u00e9orie des graphes (1978), 399--401."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10217-2_43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.04.006"},{"key":"e_1_3_2_1_18_1","volume-title":"The factorisation of linear graphs","author":"Tutte T.","year":"1947","unstructured":". T. Tutte , The factorisation of linear graphs , J. London Math . Soc .textbf22 ( 1947 ), 107--111. . T. Tutte, The factorisation of linear graphs, J. London Math. Soc.textbf22 (1947), 107--111."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":19,"alternative-id":["10.1145\/2488608.2488647","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488647","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}