{"id":"https://openalex.org/W4405231961","doi":"https://doi.org/10.1017/s0963548324000415","title":"Tight bound for the Erd\u0151s\u2013P\u00f3sa property of tree minors","display_name":"Tight bound for the Erd\u0151s\u2013P\u00f3sa property of tree minors","publication_year":2024,"publication_date":"2024-12-11","ids":{"openalex":"https://openalex.org/W4405231961","doi":"https://doi.org/10.1017/s0963548324000415"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548324000415","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548324000415","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/0AA0E54E4C2E9387B23187435C9BDE91/S0963548324000415a.pdf/div-class-title-tight-bound-for-the-erd-s-posa-property-of-tree-minors-div.pdf","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":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/0AA0E54E4C2E9387B23187435C9BDE91/S0963548324000415a.pdf/div-class-title-tight-bound-for-the-erd-s-posa-property-of-tree-minors-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000058655","display_name":"Vida Dujmovi\u0107","orcid":"https://orcid.org/0000-0001-7250-0600"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Vida Dujmovi\u0107","raw_affiliation_strings":["School of Computer Science and Electrical Engineering, University of Ottawa, Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Electrical Engineering, University of Ottawa, Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038947183","display_name":"Gwena\u00ebl Joret","orcid":"https://orcid.org/0000-0002-7157-6694"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Gwena\u00ebl Joret","raw_affiliation_strings":["Computer Science Department, Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107964690","display_name":"Piotr Micek","orcid":"https://orcid.org/0000-0001-9796-5375"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Micek","raw_affiliation_strings":["Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045902784","display_name":"Pat Morin","orcid":"https://orcid.org/0000-0003-0471-4118"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pat Morin","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038947183"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":null,"apc_paid":null,"fwci":0.2882,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62613648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"34","issue":"2","first_page":"321","last_page":"325"},"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/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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.906211256980896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6450891494750977},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6089840531349182},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6009753346443176},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.5945305824279785},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.537388265132904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48472118377685547},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4769552946090698},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4525924026966095},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.426106333732605},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4103219509124756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13920029997825623},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05094665288925171}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.906211256980896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6450891494750977},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6089840531349182},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6009753346443176},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.5945305824279785},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.537388265132904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48472118377685547},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4769552946090698},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4525924026966095},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.426106333732605},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4103219509124756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13920029997825623},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05094665288925171},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548324000415","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548324000415","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/0AA0E54E4C2E9387B23187435C9BDE91/S0963548324000415a.pdf/div-class-title-tight-bound-for-the-erd-s-posa-property-of-tree-minors-div.pdf","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:ruj.uj.edu.pl:item/570079","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/handle/item/570079","pdf_url":null,"source":{"id":"https://openalex.org/S4306401249","display_name":"Jagiellonian University Repository (Jagiellonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126596746","host_organization_name":"Jagiellonian University","host_organization_lineage":["https://openalex.org/I126596746"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/392620","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/392620","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"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":"Combinatorics, probability & computing, 34 (2","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s0963548324000415","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548324000415","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/0AA0E54E4C2E9387B23187435C9BDE91/S0963548324000415a.pdf/div-class-title-tight-bound-for-the-erd-s-posa-property-of-tree-minors-div.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310630","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16"},{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4405231961.pdf"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1530259711","https://openalex.org/W2033405938","https://openalex.org/W2033480692","https://openalex.org/W2057826895","https://openalex.org/W2082079083","https://openalex.org/W2088373372","https://openalex.org/W2332112754","https://openalex.org/W2563767922","https://openalex.org/W3014359113"],"related_works":["https://openalex.org/W2467936747","https://openalex.org/W2368619281","https://openalex.org/W2377143628","https://openalex.org/W2355995962","https://openalex.org/W2392462513","https://openalex.org/W2362718971","https://openalex.org/W2368173763","https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W2072510267"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"$T$":[2,32,52],"be":[3],"a":[4,31,37],"tree":[5],"on":[6,56,66],"$t$":[7],"vertices.":[8],"We":[9],"prove":[10],"that":[11,48],"for":[12],"every":[13,18],"positive":[14],"integer":[15],"$k$":[16,25],"and":[17,64,75,89],"graph":[19],"$G$":[20,23,46],",":[21],"either":[22],"contains":[24],"pairwise":[26],"vertex-disjoint":[27],"subgraphs":[28],"each":[29],"having":[30],"minor,":[33],"or":[34],"there":[35],"exists":[36],"set":[38],"$X$":[39,60],"of":[40,45,59],"at":[41],"most":[42],"$t(k-1)$":[43],"vertices":[44],"such":[47],"$G-X$":[49],"has":[50],"no":[51],"minor.":[53],"The":[54],"bound":[55,70],"the":[57],"size":[58],"is":[61,87],"best":[62],"possible":[63],"improves":[65],"an":[67],"earlier":[68],"$f(t)k$":[69],"proved":[71],"by":[72],"Fiorini,":[73],"Joret,":[74],"Wood":[76],"(2013)":[77],"with":[78],"some":[79],"fast-growing":[80],"function":[81],"$f(t)$":[82],".":[83],"Moreover,":[84],"our":[85],"proof":[86],"short":[88],"simple.":[90]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}