{"id":"https://openalex.org/W2165668452","doi":"https://doi.org/10.37236/549","title":"Perfect Matchings in Claw-free Cubic Graphs","display_name":"Perfect Matchings in Claw-free Cubic Graphs","publication_year":2011,"publication_date":"2011-03-24","ids":{"openalex":"https://openalex.org/W2165668452","doi":"https://doi.org/10.37236/549","mag":"2165668452"},"language":"en","primary_location":{"id":"doi:10.37236/549","is_oa":true,"landing_page_url":"https://doi.org/10.37236/549","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p62/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":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p62/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082994085","display_name":"Sang\u2010il Oum","orcid":"https://orcid.org/0000-0002-6889-7286"},"institutions":[{"id":"https://openalex.org/I4210158432","display_name":"National Institute for Mathematical Sciences","ror":"https://ror.org/04n7py080","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210158432"]},{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sang-il Oum","raw_affiliation_strings":["Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea","Department of Mathematical Sciences, KAIST, Daejeon, 305-701, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea","institution_ids":["https://openalex.org/I4210158432","https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Mathematical Sciences, KAIST, Daejeon, 305-701, Republic of Korea","institution_ids":["https://openalex.org/I4210158432","https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082994085"],"corresponding_institution_ids":["https://openalex.org/I157485424","https://openalex.org/I4210158432"],"apc_list":null,"apc_paid":null,"fwci":0.6463,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.72164307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"18","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":1.0,"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":1.0,"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.9997000098228455,"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.9994000196456909,"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.8728793859481812},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.779503345489502},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6940643787384033},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.6232024431228638},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5867804288864136},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.47172847390174866},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.469265878200531},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46756869554519653},{"id":"https://openalex.org/keywords/trivially-perfect-graph","display_name":"Trivially perfect graph","score":0.45679381489753723},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4531944990158081},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4272100329399109},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4206300377845764},{"id":"https://openalex.org/keywords/perfect-graph-theorem","display_name":"Perfect graph theorem","score":0.4158020317554474},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3589359223842621},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33671051263809204},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.31110918521881104},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.30291926860809326},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07328486442565918}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8728793859481812},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.779503345489502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6940643787384033},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.6232024431228638},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5867804288864136},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.47172847390174866},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.469265878200531},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46756869554519653},{"id":"https://openalex.org/C170903109","wikidata":"https://www.wikidata.org/wiki/Q7844666","display_name":"Trivially perfect graph","level":5,"score":0.45679381489753723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4531944990158081},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4272100329399109},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4206300377845764},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.4158020317554474},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3589359223842621},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33671051263809204},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.31110918521881104},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30291926860809326},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07328486442565918}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/549","is_oa":true,"landing_page_url":"https://doi.org/10.37236/549","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p62/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:arXiv.org:0906.2261","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0906.2261","pdf_url":"https://arxiv.org/pdf/0906.2261","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/549","is_oa":true,"landing_page_url":"https://doi.org/10.37236/549","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p62/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":[{"id":"https://openalex.org/G342704958","display_name":null,"funder_award_id":"funded","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2165668452.pdf","grobid_xml":"https://content.openalex.org/works/W2165668452.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W140130170","https://openalex.org/W1558167226","https://openalex.org/W1982321501","https://openalex.org/W2003777791","https://openalex.org/W2034093914","https://openalex.org/W2081357884","https://openalex.org/W2109425200","https://openalex.org/W2164264448","https://openalex.org/W2327315803","https://openalex.org/W2335389215","https://openalex.org/W4240555338","https://openalex.org/W6676646709"],"related_works":["https://openalex.org/W2105838663","https://openalex.org/W206883905","https://openalex.org/W1999389412","https://openalex.org/W2999485140","https://openalex.org/W2952282781","https://openalex.org/W79110151","https://openalex.org/W4311087106","https://openalex.org/W4299293249","https://openalex.org/W4381236283","https://openalex.org/W2236017388"],"abstract_inverted_index":{"Lov\u00e1sz":[0],"and":[1,37,42],"Plummer":[2],"conjectured":[3],"that":[4,13,46],"there":[5],"exists":[6],"a":[7],"fixed":[8],"positive":[9],"constant":[10],"$c$":[11],"such":[12],"every":[14,47],"cubic":[15,49],"$n$-vertex":[16,50],"graph":[17,51],"with":[18,52],"no":[19,53],"cutedge":[20,54],"has":[21,29,55],"at":[22],"least":[23],"$2^{cn}$":[24],"perfect":[25,59],"matchings.":[26],"Their":[27],"conjecture":[28,64],"been":[30],"verified":[31],"for":[32,65],"bipartite":[33],"graphs":[34,39],"by":[35,40],"Voorhoeve":[36],"planar":[38],"Chudnovsky":[41],"Seymour.":[43],"We":[44],"prove":[45],"claw-free":[48,66],"more":[56],"than":[57],"$2^{n/12}$":[58],"matchings,":[60],"thus":[61],"verifying":[62],"the":[63],"graphs.":[67]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}