{"id":"https://openalex.org/W7147514421","doi":"https://doi.org/10.48550/arxiv.2603.29825","title":"Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs","display_name":"Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7147514421","doi":"https://doi.org/10.48550/arxiv.2603.29825"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.29825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29825","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.29825","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132616179","display_name":"D\u00e1niel Marx","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marx, D\u00e1niel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132630096","display_name":"Marcin Pilipczuk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pilipczuk, Marcin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132689909","display_name":"Micha\u0142 Pilipczuk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pilipczuk, Micha\u0142","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6654999852180481,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6654999852180481,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.28029999136924744,"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.010400000028312206,"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/intersection","display_name":"Intersection (aeronautics)","score":0.5670999884605408},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5267000198364258},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5221999883651733},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4867999851703644},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48500001430511475},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4320000112056732},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4032000005245209},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.39800000190734863},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.385699987411499},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.35850000381469727}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7522000074386597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6786999702453613},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5670999884605408},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5267000198364258},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5221999883651733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5133000016212463},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4867999851703644},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48500001430511475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4320000112056732},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.39800000190734863},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.385699987411499},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.329800009727478},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.3276999890804291},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.322299987077713},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.3192000091075897},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.31769999861717224},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.28600001335144043},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.27880001068115234},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2786000072956085},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.2639000117778778},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.29825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29825","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.29825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29825","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"an":[1,6,19],"$H$-minor-free":[2],"graph":[3],"$G$":[4,24],"and":[5,25,53,128,145,206],"integer":[7],"$k$,":[8,42,94],"our":[9,102],"main":[10],"technical":[11],"contribution":[12],"is":[13,88],"sampling":[14],"in":[15,81,198],"randomized":[16],"polynomial":[17],"time":[18,83],"induced":[20],"subgraph":[21],"$G'$":[22,30],"of":[23,29,31,40,56,65,79,92,109,113,133,186,191],"a":[26,69,76,89,147,183,196],"tree":[27,58,70],"decomposition":[28,59,71],"width":[32],"$\\widetilde{O}(k)$":[33],"such":[34,68,201],"that":[35,158],"for":[36,138,146],"every":[37,54],"$Z\\subseteq":[38],"V(G)$":[39],"size":[41,93],"with":[43,165],"probability":[44],"at":[45,61],"least":[46],"$\\left(2^{\\widetilde{O}(\\sqrt{k})}|V(G)|^{O(1)}\\right)^{-1}$,":[47],"we":[48,151],"have":[49],"$Z":[50],"\\subseteq":[51],"V(G')$":[52],"bag":[55],"the":[57,86,106,110,123,129,154,170,189,192,199],"contains":[60],"most":[62],"$\\widetilde{O}(\\sqrt{k})$":[63,164],"vertices":[64],"$Z$.":[66],"Having":[67],"allows":[72],"us":[73],"to":[74,125,181],"solve":[75],"wide":[77],"range":[78,185],"problems":[80,187,205,207],"(randomized)":[82],"$2^{\\widetilde{O}(\\sqrt{k})}n^{O(1)}$":[84],"where":[85,188],"solution":[87],"pattern":[90,124,193],"$Z$":[91,161],"e.g.,":[95],"Directed":[96],"$k$-Path,":[97],"$H$-Packing,":[98],"etc.":[99],"In":[100],"particular,":[101],"result":[103,112,155],"recovers":[104],"all":[105],"algorithmic":[107],"applications":[108],"pattern-covering":[111],"Fomin":[114],"et":[115],"al.":[116],"[SIAM":[117],"J.":[118],"Computing":[119],"2022]":[120],"(which":[121,141],"requires":[122],"be":[126],"connected)":[127],"planar":[130],"subgraph-finding":[131],"algorithms":[132],"Nederlof":[134],"[STOC":[135],"2020].":[136],"Furthermore,":[137],"$K_{h,3}$-free":[139],"graphs":[140],"include":[142],"bounded-genus":[143],"graphs)":[144],"fixed":[148],"constant":[149],"$d$,":[150],"signficantly":[152],"strengthen":[153],"by":[156],"ensuring":[157],"not":[159],"only":[160],"has":[162],"intersection":[163],"each":[166],"bag,":[167],"but":[168],"even":[169],"distance-$d$":[171],"neighborhood":[172,190],"$N^d_{G}[Z]$":[173],"as":[174,202],"well.":[175],"This":[176],"extension":[177],"makes":[178],"it":[179],"possible":[180],"handle":[182],"wider":[184],"also":[194],"plays":[195],"role":[197],"solution,":[200],"partial":[203],"domination":[204],"involving":[208],"distance":[209],"constraints.":[210]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-02T00:00:00"}