{"id":"https://openalex.org/W2786834732","doi":"https://doi.org/10.1137/16m1092921","title":"Packing $k$-Matchings and $k$-Critical Graphs","display_name":"Packing $k$-Matchings and $k$-Critical Graphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2786834732","doi":"https://doi.org/10.1137/16m1092921","mag":"2786834732"},"language":"en","primary_location":{"id":"doi:10.1137/16m1092921","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1092921","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-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/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5079559219"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04377037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":"320","last_page":"351"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8537777662277222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.822820246219635},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.643535852432251},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5610536932945251},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5368943810462952},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.455710232257843},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43139705061912537},{"id":"https://openalex.org/keywords/structured-program-theorem","display_name":"Structured program theorem","score":0.4218016266822815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41770750284194946},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22192946076393127},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21780458092689514}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8537777662277222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.822820246219635},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.643535852432251},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5610536932945251},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5368943810462952},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.455710232257843},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43139705061912537},{"id":"https://openalex.org/C180375552","wikidata":"https://www.wikidata.org/wiki/Q2635326","display_name":"Structured program theorem","level":2,"score":0.4218016266822815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41770750284194946},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22192946076393127},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21780458092689514},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1092921","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1092921","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1963596676","https://openalex.org/W1968008035","https://openalex.org/W1973995785","https://openalex.org/W1975102601","https://openalex.org/W1985061810","https://openalex.org/W1995435632","https://openalex.org/W1996482242","https://openalex.org/W1999341643","https://openalex.org/W2005964580","https://openalex.org/W2006069852","https://openalex.org/W2011186779","https://openalex.org/W2012855576","https://openalex.org/W2018542201","https://openalex.org/W2020723104","https://openalex.org/W2034740022","https://openalex.org/W2037953913","https://openalex.org/W2038558760","https://openalex.org/W2048952924","https://openalex.org/W2051531807","https://openalex.org/W2053711501","https://openalex.org/W2054076729","https://openalex.org/W2060113522","https://openalex.org/W2061237693","https://openalex.org/W2062070505","https://openalex.org/W2067665587","https://openalex.org/W2068431006","https://openalex.org/W2077574397","https://openalex.org/W2086077818","https://openalex.org/W2087348204","https://openalex.org/W2087798501","https://openalex.org/W2092664455","https://openalex.org/W2114935764","https://openalex.org/W2136481365","https://openalex.org/W2149498497","https://openalex.org/W2165843952","https://openalex.org/W2317309498","https://openalex.org/W2327315803","https://openalex.org/W2329208637","https://openalex.org/W3000432478","https://openalex.org/W4230454969","https://openalex.org/W4233756358","https://openalex.org/W4234588983","https://openalex.org/W4242581432","https://openalex.org/W4256646394","https://openalex.org/W4256731050"],"related_works":["https://openalex.org/W3162204513","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2080152487","https://openalex.org/W2239445980","https://openalex.org/W2995553446","https://openalex.org/W3083152911","https://openalex.org/W2009063799"],"abstract_inverted_index":{"A":[0],"(simple)":[1],"$k$-matching":[2,19,25],"in":[3],"a":[4,7,24,27,68,71,88,100,114,118],"graph":[5],"is":[6,21],"subgraph":[8],"all":[9],"of":[10,30,66,74,104],"whose":[11,76],"nodes":[12],"have":[13],"degree":[14],"at":[15],"most":[16],"$k$.":[17],"The":[18],"problem":[20,65],"to":[22,51,53,61,63,131,139],"find":[23],"with":[26,70],"maximum":[28,72],"number":[29,73],"edges.":[31],"Well-known":[32],"results":[33,57],"for":[34,126],"the":[35,41,64,123],"classical":[36],"$1$-matching":[37],"problem,":[38],"such":[39],"as":[40],"Tutte--Berge":[42],"min-max":[43,115,134],"theorem":[44,120,125],"and":[45,82,117,135],"Edmonds's":[46],"polynomial-time":[47],"algorithm,":[48,113],"are":[49,58,79],"known":[50,60],"generalize":[52,62],"$k$-matchings.":[54],"These":[55],"1-matching":[56,108],"also":[59],"finding":[67],"subgraph,":[69],"nodes,":[75],"connected":[77],"components":[78],"isolated":[80],"edges":[81],"1-critical":[83],"(or":[84],"hypomatchable)":[85],"graphs":[86],"from":[87],"specified":[89],"set":[90],"(e.g.,":[91],"triangles":[92],"or":[93],"pentagons).":[94],"In":[95],"this":[96],"paper":[97],"we":[98],"present":[99,111],"new":[101],"common":[102],"generalization":[103],"these":[105],"two":[106],"generalized":[107],"problems.":[109],"We":[110],"an":[112],"theorem,":[116],"structure":[119,136],"(that":[121],"generalizes":[122],"Edmonds--Gallai":[124],"1-matchings).":[127],"Even":[128],"when":[129],"specialized":[130],"$k$-matchings,":[132],"our":[133],"theorems":[137],"appear":[138],"be":[140],"new.":[141]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}