{"id":"https://openalex.org/W2066606830","doi":"https://doi.org/10.1017/s0963548306007784","title":"Extremal Functions for Shortening Sets of Paths","display_name":"Extremal Functions for Shortening Sets of Paths","publication_year":2006,"publication_date":"2006-08-14","ids":{"openalex":"https://openalex.org/W2066606830","doi":"https://doi.org/10.1017/s0963548306007784","mag":"2066606830"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548306007784","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007784","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5035367746","display_name":"Paul Wollan","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PAUL WOLLAN","raw_affiliation_strings":["School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332, USA (e-mail:","School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332, USA (e-mail: wollan@math.gatech.edu)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332, USA (e-mail:","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332, USA (e-mail: wollan@math.gatech.edu)","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035367746"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13850897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"6","first_page":"927","last_page":"932"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9973999857902527,"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.9969000220298767,"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/disjoint-sets","display_name":"Disjoint sets","score":0.8311221599578857},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8107064962387085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.657721757888794},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.587312638759613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.520112156867981},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3309127986431122}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8311221599578857},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8107064962387085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.657721757888794},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.587312638759613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.520112156867981},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3309127986431122}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548306007784","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007784","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.4345","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.4345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uni-hamburg.de/home/wollan/short_paths_web.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/443293","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/443293","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1976285925","https://openalex.org/W2019624146","https://openalex.org/W2059563583","https://openalex.org/W2060765530","https://openalex.org/W2381070482"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W2587900963","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Let":[0,22],"$P_1,":[1],"{\\ldots}\\,,P_k$":[2],"be":[3,24],"$k$":[4],"vertex-disjoint":[5],"paths":[6,53,83],"in":[7,135,154],"a":[8],"graph":[9],"$G$":[10],"where":[11,56,87],"the":[12,25,29,33,57,88,132,151],"ends":[13,58,89],"of":[14,32,59,90],"$P_i$":[15],"are":[16,61,92,131],"$x_i$":[17,62],",":[18,40,48,78,112,114],"and":[19,63,94,103,117,156],"$y_i$":[20],".":[21,128],"$H$":[23],"subgraph":[26],"induced":[27],"by":[28],"vertex":[30],"sets":[31],"paths.":[34],"We":[35],"find":[36],"edge":[37],"bounds":[38,130],"$E_1(n)$":[39],"$E_2(n)$":[41],"such":[42,66,96],"that:":[43],"if":[44,74],"$e(H)":[45,75],"\\geq":[46,76],"E_1(|V(H)|)$":[47],"then":[49,79],"there":[50,80,137],"exist":[51,81,138],"disjoint":[52,82],"$P_1',":[54,84],"{\\ldots}\\,,P_k'$":[55],"$P_i'$":[60,91],"$":[64],"y_i$":[65],"that":[67,97,136],"$|\\bigcup_i":[68,98],"V(P_i)|":[69,99],">":[70,100],"|\\bigcup_i":[71,101],"V(P_i')|$":[72,102],";":[73],"E_2(|V(H)|)$":[77],"{\\ldots}\\,,":[85,106,120,126],"P_k'$":[86],"$x_i'$":[93],"$y_i'$":[95],"$\\{":[104,118],"x_1,":[105],"x_k":[107],"\\}":[108,122],"=":[109,123,145],"\\{":[110,124],"x_1'":[111],"{\\ldots}\\,":[113],"x_k'":[115],"\\}$":[116],"y_1,":[119],"y_k":[121],"y_1',":[125],"y_k'\\}$":[127],"The":[129],"best":[133],"possible,":[134],"arbitrarily":[139],"large":[140],"graphs":[141],"$H'$":[142],"with":[143],"$e(H')":[144],"E_i":[146],"(H')":[147],"-":[148],"1$":[149],"without":[150],"properties":[152],"stipulated":[153],"1":[155],"2.":[157]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}