{"id":"https://openalex.org/W7135240297","doi":"https://doi.org/10.48550/arxiv.2603.11379","title":"Induced Minors and Coarse Tree Decompositions","display_name":"Induced Minors and Coarse Tree Decompositions","publication_year":2026,"publication_date":"2026-03-11","ids":{"openalex":"https://openalex.org/W7135240297","doi":"https://doi.org/10.48550/arxiv.2603.11379"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11379","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11379","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.11379","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129078974","display_name":"Maria Chudnovsky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chudnovsky, Maria","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5099136871","display_name":"Julien Codsi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Codsi, Julien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122083825","display_name":"Ajaykrishnan E S","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S, Ajaykrishnan E","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129084546","display_name":"Daniel Lokshtanov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lokshtanov, Daniel","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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.57669997215271,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.57669997215271,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.34369999170303345,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.031599998474121094,"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/conjecture","display_name":"Conjecture","score":0.6010000109672546},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5996999740600586},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4932999908924103},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4747999906539917},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.4228000044822693},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41620001196861267},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4077000021934509},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.38350000977516174}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8795999884605408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8741999864578247},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6010000109672546},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5996999740600586},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5105000138282776},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4932999908924103},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4747999906539917},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.4228000044822693},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41620001196861267},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.38350000977516174},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.32989999651908875},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.265500009059906},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.26489999890327454},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.262800008058548},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.2621000111103058}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11379","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11379","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.11379","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11379","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"$G$":[1,13,83],"be":[2,8,16],"a":[3,9,17,47,101,119,149],"graph,":[4],"$S":[5],"\\subseteq":[6,34],"V(G)$":[7],"vertex":[10],"set":[11],"in":[12,44,56,104],"and":[14,92],"$r$":[15,52],"positive":[18,70,75],"integer.":[19],"The":[20],"distance":[21,133,161],"$r$-independence":[22],"number":[23,112,138,163],"of":[24,29,42,122,128,151,157],"$S$":[25],"is":[26],"the":[27,30,87,93,129,144,152,158],"size":[28],"largest":[31],"subset":[32],"$I":[33],"S$":[35],"such":[36,79],"that":[37,67,80,84],"no":[38],"pair":[39],"$u$,":[40],"$v$":[41],"vertices":[43],"$I$":[45],"have":[46],"path":[48],"on":[49],"at":[50,113,139,164],"most":[51,114,140,165],"edges":[53],"between":[54],"them":[55],"$G$.":[57],"It":[58],"has":[59,100,108,132,160],"been":[60],"conjectured":[61],"[Chudnovsky":[62],"et":[63],"al.,":[64],"arXiv,":[65],"2025]":[66],"for":[68],"every":[69,81,106,126,155],"integer":[71],"$t$":[72],"there":[73],"exist":[74],"integers":[76],"$c$,":[77],"$d$":[78],"graph":[82,90],"excludes":[85],"both":[86],"complete":[88],"bipartite":[89],"$K_{t,t}$":[91],"grid":[94],"$\\boxplus_t$":[95],"as":[96],"an":[97],"induced":[98],"minor":[99],"tree":[102,130],"decomposition":[103,131,159],"which":[105],"bag":[107,127,156],"(distance":[109],"$1$)":[110],"independence":[111],"$c(\\log":[115,141],"n)^d$.":[116,142],"We":[117],"prove":[118,148],"weaker":[120],"version":[121,150],"this":[123],"conjecture":[124,153],"where":[125,154],"$16(\\log":[134],"n":[135],"+":[136],"1)$-independence":[137],"On":[143],"way":[145],"we":[146],"also":[147],"$8$-independence":[162],"$2^{c":[166],"(\\log":[167],"n)^{1-(1/d)}}$.":[168]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-14T00:00:00"}