{"id":"https://openalex.org/W1501191738","doi":"https://doi.org/10.37236/991","title":"Maximum Cardinality 1-Restricted Simple 2-Matchings","display_name":"Maximum Cardinality 1-Restricted Simple 2-Matchings","publication_year":2007,"publication_date":"2007-11-05","ids":{"openalex":"https://openalex.org/W1501191738","doi":"https://doi.org/10.37236/991","mag":"1501191738"},"language":"en","primary_location":{"id":"doi:10.37236/991","is_oa":true,"landing_page_url":"https://doi.org/10.37236/991","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r73/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r73/pdf","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":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":["University of Notre Dame Notre Dame, IN 46556-5646"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame Notre Dame, IN 46556-5646","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079559219"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.0502186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908999800682068,"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/combinatorics","display_name":"Combinatorics","score":0.8855575323104858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8594900369644165},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7239193916320801},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.64808189868927},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5911150574684143},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5378450751304626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5243492722511292},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5211658477783203},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.44191548228263855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42423051595687866},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.41915005445480347},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4166381061077118},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21709170937538147},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11672365665435791},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06583172082901001}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8855575323104858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8594900369644165},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7239193916320801},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.64808189868927},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5911150574684143},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5378450751304626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5243492722511292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5211658477783203},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.44191548228263855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42423051595687866},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.41915005445480347},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4166381061077118},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21709170937538147},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11672365665435791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06583172082901001},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/991","is_oa":true,"landing_page_url":"https://doi.org/10.37236/991","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r73/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.2229","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.2229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_14/PDF/v14i1r73.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/991","is_oa":true,"landing_page_url":"https://doi.org/10.37236/991","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r73/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1501191738.pdf","grobid_xml":"https://content.openalex.org/works/W1501191738.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1516152095","https://openalex.org/W1554678859","https://openalex.org/W1963596676","https://openalex.org/W1973995785","https://openalex.org/W1978451969","https://openalex.org/W1985061810","https://openalex.org/W1996962956","https://openalex.org/W2008816808","https://openalex.org/W2037953913","https://openalex.org/W2087348204","https://openalex.org/W2087798501","https://openalex.org/W2092483998","https://openalex.org/W2172285784","https://openalex.org/W2280145274","https://openalex.org/W2317309498","https://openalex.org/W2411340147","https://openalex.org/W2988480584","https://openalex.org/W4233756358","https://openalex.org/W4285719527","https://openalex.org/W6609737820","https://openalex.org/W6817237904"],"related_works":["https://openalex.org/W4322767636","https://openalex.org/W2796606627","https://openalex.org/W3019714789","https://openalex.org/W4379118151","https://openalex.org/W2014594560","https://openalex.org/W2143340273","https://openalex.org/W938372727","https://openalex.org/W4390189596","https://openalex.org/W4230093114","https://openalex.org/W1236608458"],"abstract_inverted_index":{"A":[0,18],"simple":[1,19,39,78,95],"2-matching":[2,20,40,96],"in":[3,59,75],"a":[4,7,37,42,49,56,60,66,76,87,93,98],"graph":[5],"is":[6,21,48,65],"subgraph":[8],"all":[9],"of":[10,35,45,51,54,73,101],"whose":[11],"nodes":[12],"have":[13],"degree":[14],"$1$":[15],"or":[16],"$2$.":[17],"called":[22],"$k$-restricted":[23,38],"if":[24],"every":[25],"connected":[26],"component":[27],"has":[28],"$>k$":[29],"edges.":[30,102],"We":[31,80],"consider":[32],"the":[33,52,70],"problem":[34,53],"finding":[36,55,92],"with":[41,97],"maximum":[43,71,99],"number":[44,72,100],"edges,":[46],"which":[47],"relaxation":[50],"Hamilton":[57],"cycle":[58],"graph.":[61],"Our":[62],"main":[63],"result":[64,83],"min-max":[67],"theorem":[68],"for":[69,91],"edges":[74],"1-restricted":[77,94],"2-matching.":[79],"prove":[81],"this":[82],"constructively":[84],"by":[85],"presenting":[86],"polynomial":[88],"time":[89],"algorithm":[90]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}