{"id":"https://openalex.org/W2011105641","doi":"https://doi.org/10.1137/0404010","title":"Spanning Trees with Many Leaves","display_name":"Spanning Trees with Many Leaves","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W2011105641","doi":"https://doi.org/10.1137/0404010","mag":"2011105641"},"language":"en","primary_location":{"id":"doi:10.1137/0404010","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0404010","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/A5058820400","display_name":"Daniel J. Kleitman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel J. Kleitman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Douglas B. West","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058820400"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0526,"has_fulltext":false,"cited_by_count":213,"citation_normalized_percentile":{"value":0.85985328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"4","issue":"1","first_page":"99","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8726012706756592},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8693532943725586},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8100230693817139},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6116427183151245},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.585506021976471},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5804674625396729},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5419339537620544},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.49898672103881836},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4639686346054077},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.45759233832359314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3971383273601532}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8726012706756592},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8693532943725586},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8100230693817139},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6116427183151245},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.585506021976471},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5804674625396729},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5419339537620544},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.49898672103881836},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4639686346054077},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.45759233832359314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3971383273601532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0404010","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0404010","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.571.2103","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.571.2103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.illinois.edu/~dwest/pubs/leaves.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2035595356","https://openalex.org/W2048653445","https://openalex.org/W2064084823","https://openalex.org/W2078178103"],"related_works":["https://openalex.org/W3099328339","https://openalex.org/W2099915933","https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2803918337","https://openalex.org/W2082872574","https://openalex.org/W2015718828","https://openalex.org/W3141326665","https://openalex.org/W2350799039","https://openalex.org/W2069416867"],"abstract_inverted_index":{"A":[0],"connected":[1,30],"graph":[2,32],"having":[3],"large":[4,114],"minimum":[5,34],"vertex":[6],"degree":[7,35],"must":[8],"have":[9],"a":[10,40,91],"spanning":[11,41,92],"tree":[12,42,93],"with":[13,33,43,94],"many":[14],"leaves.":[15,47,101],"In":[16],"particular,":[17],"let":[18],"$l(":[19,49,64,103],"n,k":[20,65,104],")$":[21],"be":[22],"the":[23,97],"maximum":[24],"integer":[25],"m":[26,46],"such":[27],"that":[28,89],"every":[29],"n-vertex":[31],"at":[36,44,95],"least":[37,45,96],"k":[38,71],"has":[39],"Then":[48],"n,3":[50],")\\geqq":[51,57,105],"n/4":[52],"+":[53,60,72,76],"2,":[54],"l(":[55],"n,4":[56],"(":[58,106],"2n":[59],"8":[61],")/5,$":[62],"and":[63],")\\leqq":[66],"n":[67],"-":[68,108],"3\\lfloor":[69],"n/(":[70],"1":[73,107],")":[74],"\\rfloor":[75],"2$":[77],"for":[78,113],"all":[79],"k.":[80],"The":[81],"lower":[82],"bounds":[83],"are":[84],"proved":[85,117],"by":[86],"an":[87],"algorithm":[88],"constructs":[90],"desired":[98],"number":[99],"of":[100],"Finally,":[102],"b":[109,120],"\\ln":[110],"k/k":[111],")n$":[112],"k,":[115],"again":[116],"algorithmically,":[118],"where":[119],"is":[121],"any":[122],"constant":[123],"exceeding":[124],"2.5.":[125]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":45},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}