{"id":"https://openalex.org/W2963068836","doi":"https://doi.org/10.1145/2488608.2488647","title":"Polynomial-time perfect matchings in dense hypergraphs","display_name":"Polynomial-time perfect matchings in dense hypergraphs","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W2963068836","doi":"https://doi.org/10.1145/2488608.2488647","mag":"2963068836"},"language":"en","primary_location":{"id":"doi:10.1145/2488608.2488647","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023231478","display_name":"Peter Keevash","orcid":"https://orcid.org/0000-0002-4605-5045"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter Keevash","raw_affiliation_strings":["Queen Mary, University of London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen Mary, University of London, London, United Kingdom","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063051891","display_name":"Fiachra Knox","orcid":null},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Fiachra Knox","raw_affiliation_strings":["Queen Mary, University of London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen Mary, University of London, London, United Kingdom","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035180795","display_name":"Richard Mycroft","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Richard Mycroft","raw_affiliation_strings":["University of Birmingham, Birmingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4898,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.84403205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"311","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.64060378074646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.515250027179718},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4696618318557739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45279017090797424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4394175112247467},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37316328287124634}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.64060378074646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.515250027179718},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4696618318557739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45279017090797424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4394175112247467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37316328287124634},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2488608.2488647","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/9732cfa2-0dda-47d6-ae3c-d16080abd891","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/9732cfa2-0dda-47d6-ae3c-d16080abd891","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Keevash, P, Knox, F & Mycroft, R 2013, Polynomial-time perfect matchings in dense hypergraphs. in Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 311-320. https://doi.org/10.1145/2488608.2488647","raw_type":"bookPart"},{"id":"pmh:oai:pure.atira.dk:publications/9732cfa2-0dda-47d6-ae3c-d16080abd891","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/polynomialtime-perfect-matchings-in-dense-hypergraphs(9732cfa2-0dda-47d6-ae3c-d16080abd891).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Keevash , P , Knox , F & Mycroft , R 2013 , Polynomial-time perfect matchings in dense hypergraphs . in Proceedings of the Annual ACM Symposium on Theory of Computing . pp. 311-320 . https://doi.org/10.1145/2488608.2488647","raw_type":"bookPart"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6717544416","display_name":null,"funder_award_id":"EP/G056730/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1560717733","https://openalex.org/W1578813712","https://openalex.org/W1599335667","https://openalex.org/W1603859152","https://openalex.org/W1838065876","https://openalex.org/W1966599810","https://openalex.org/W1971367602","https://openalex.org/W1978240867","https://openalex.org/W1985061810","https://openalex.org/W2014564484","https://openalex.org/W2021207464","https://openalex.org/W2027878806","https://openalex.org/W2032300475","https://openalex.org/W2065836783","https://openalex.org/W2066356146","https://openalex.org/W2070866278","https://openalex.org/W2074971154","https://openalex.org/W2082377673","https://openalex.org/W2105457218","https://openalex.org/W2116537669","https://openalex.org/W2127902766","https://openalex.org/W2133479668","https://openalex.org/W2134792353","https://openalex.org/W2144292514","https://openalex.org/W2170527238","https://openalex.org/W2183769808","https://openalex.org/W2401610261","https://openalex.org/W2949510484","https://openalex.org/W2950509301","https://openalex.org/W2963988718","https://openalex.org/W3144881883","https://openalex.org/W4233121052","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712"],"abstract_inverted_index":{"Let":[0],"H":[1,37],"be":[2],"a":[3,27,33,39,47,63,74,92],"k-graph":[4],"on":[5,73],"n":[6],"vertices,":[7],"with":[8,87],"minimum":[9,64],"codegree":[10,65],"at":[11],"least":[12],"n/k":[13,67],"+":[14],"cn":[15],"for":[16,62],"some":[17],"fixed":[18],"c":[19],">":[20],"0.":[21],"In":[22],"this":[23,58],"paper":[24],"we":[25,82],"construct":[26],"polynomial-time":[28],"algorithm":[29,71],"which":[30,81],"finds":[31],"either":[32],"perfect":[34,89],"matching":[35,90],"in":[36,80],"or":[38],"certificate":[40],"that":[41,57],"none":[42],"exists.":[43],"This":[44],"essentially":[45],"solves":[46],"problem":[48,59],"of":[49,66,77,94],"Karpinski,":[50],"Rucinski":[51],"and":[52],"Szymanska,":[53],"who":[54],"previously":[55],"showed":[56],"is":[60],"NP-hard":[61],"-":[68],"cn.":[69],"Our":[70],"relies":[72],"theoretical":[75],"result":[76],"independent":[78],"interest,":[79],"characterise":[83],"any":[84],"such":[85],"hypergraph":[86],"no":[88],"using":[91],"family":[93],"lattice-based":[95],"constructions.":[96]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}