{"id":"https://openalex.org/W2032104747","doi":"https://doi.org/10.37236/3971","title":"Treewidth of the Kneser Graph and the Erd\u0151s-Ko-Rado Theorem","display_name":"Treewidth of the Kneser Graph and the Erd\u0151s-Ko-Rado Theorem","publication_year":2014,"publication_date":"2014-02-28","ids":{"openalex":"https://openalex.org/W2032104747","doi":"https://doi.org/10.37236/3971","mag":"2032104747"},"language":"en","primary_location":{"id":"doi:10.37236/3971","is_oa":true,"landing_page_url":"https://doi.org/10.37236/3971","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i1p48/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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/v21i1p48/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018558486","display_name":"Daniel J. Harvey","orcid":null},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Daniel J. Harvey","raw_affiliation_strings":["Department of Mathematics and Statistics, The University of Melbourne","Department of Mathematics and Statistics, The University of Melbourne#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, The University of Melbourne","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, The University of Melbourne#TAB#","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066302647","display_name":"David R. Wood","orcid":"https://orcid.org/0000-0001-8866-3041"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"David R. Wood","raw_affiliation_strings":["School of Mathematical Sciences, Monash University"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Monash University","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018558486"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.3656,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.63140676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"21","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.9986000061035156,"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.9986000061035156,"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/T11476","display_name":"Graph theory and applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9976000189781189,"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.855340838432312},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8012716770172119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.792046308517456},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5727363228797913},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5509459376335144},{"id":"https://openalex.org/keywords/graph-minor","display_name":"Graph minor","score":0.5507824420928955},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48849737644195557},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4246750473976135},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.42339447140693665},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.42322683334350586},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4160105586051941},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3538888394832611},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3456087112426758},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.30431658029556274},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2889479398727417},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.21769186854362488}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.855340838432312},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8012716770172119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.792046308517456},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5727363228797913},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5509459376335144},{"id":"https://openalex.org/C140752511","wikidata":"https://www.wikidata.org/wiki/Q905837","display_name":"Graph minor","level":5,"score":0.5507824420928955},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48849737644195557},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4246750473976135},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.42339447140693665},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.42322683334350586},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4160105586051941},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3538888394832611},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3456087112426758},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30431658029556274},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2889479398727417},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.21769186854362488}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/3971","is_oa":true,"landing_page_url":"https://doi.org/10.37236/3971","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i1p48/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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:monash.edu:openaire/aebb7083-b6df-4132-a2df-2623f0de5b61","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/aebb7083-b6df-4132-a2df-2623f0de5b61","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Harvey, D & Wood, D 2014, 'Treewidth of the Kneser graph and the Erd\u0151s-Ko-Rado Theorem', The Electronic Journal of Combinatorics, vol. 21, no. 1, P1.48, pp. 1 - 11.","raw_type":"article"},{"id":"pmh:oai:monash.edu:publications/aebb7083-b6df-4132-a2df-2623f0de5b61","is_oa":true,"landing_page_url":"http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p48/pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Harvey, D & Wood, D 2014, 'Treewidth of the Kneser graph and the Erd\u0151s-Ko-Rado Theorem', The Electronic Journal of Combinatorics, vol. 21, no. 1, P1.48, pp. 1 - 11.","raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/3971","is_oa":true,"landing_page_url":"https://doi.org/10.37236/3971","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i1p48/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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2032104747.pdf","grobid_xml":"https://content.openalex.org/works/W2032104747.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W617577063","https://openalex.org/W1986759150","https://openalex.org/W2003995429","https://openalex.org/W2019935404","https://openalex.org/W2029448190","https://openalex.org/W2034144691","https://openalex.org/W2048043479","https://openalex.org/W2084478247","https://openalex.org/W2135552440","https://openalex.org/W2159003936","https://openalex.org/W2953006237","https://openalex.org/W4393210988"],"related_works":["https://openalex.org/W83147424","https://openalex.org/W2275773863","https://openalex.org/W2017277785","https://openalex.org/W2108557121","https://openalex.org/W2067431706","https://openalex.org/W1997890669","https://openalex.org/W2803377402","https://openalex.org/W2963070003","https://openalex.org/W3188704289","https://openalex.org/W2056471617"],"abstract_inverted_index":{"Treewidth":[0],"is":[1,19],"an":[2],"important":[3],"and":[4],"well-known":[5],"graph":[6,17,21],"parameter":[7],"that":[8,27],"measures":[9],"the":[10,20,47,51,55,66],"complexity":[11],"of":[12,41,50,57,65,79,82],"a":[13,63,77],"graph.":[14,53],"The":[15],"Kneser":[16,52],"Kneser$(n,k)$":[18],"with":[22,43,72],"vertex":[23],"set":[24],"$\\binom{[n]}{k}$,":[25],"such":[26],"two":[28],"vertices":[29],"are":[30,34,84],"adjacent":[31],"if":[32],"they":[33],"disjoint.":[35],"We":[36],"determine,":[37],"for":[38],"large":[39,70],"values":[40],"$n$":[42,71],"respect":[44,73],"to":[45,74],"$k$,":[46],"exact":[48],"treewidth":[49],"In":[54],"process":[56],"doing":[58],"so,":[59],"we":[60],"also":[61],"prove":[62],"strengthening":[64],"Erd\u0151s-Ko-Rado":[67],"Theorem":[68],"(for":[69],"$k$)":[75],"when":[76],"number":[78],"disjoint":[80],"pairs":[81],"$k$-sets":[83],"allowed.":[85]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}