{"id":"https://openalex.org/W7168273089","doi":"https://doi.org/10.48550/arxiv.2607.10941","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","display_name":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","publication_year":2026,"publication_date":"2026-07-12","ids":{"openalex":"https://openalex.org/W7168273089","doi":"https://doi.org/10.48550/arxiv.2607.10941"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.10941","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10941","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2607.10941","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140720302","display_name":"Jan Dreier","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dreier, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140600900","display_name":"Nikolas M\u00e4hlmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M\u00e4hlmann, Nikolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140608498","display_name":"Rose McCarty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"McCarty, Rose","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140577738","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":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140719255","display_name":"Szymon Toru\u0144czyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toru\u0144czyk, Szymon","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/T10374","display_name":"Advanced Graph Theory Research","score":0.34619998931884766,"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.34619998931884766,"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.1873999983072281,"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/T10142","display_name":"Formal Methods in Verification","score":0.14659999310970306,"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/reachability","display_name":"Reachability","score":0.520799994468689},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49729999899864197},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.49160000681877136},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4699999988079071},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3968999981880188},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.3962000012397766},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.3813000023365021},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.3481000065803528},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.3319999873638153}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7257999777793884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6365000009536743},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5795000195503235},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.520799994468689},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49729999899864197},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.49160000681877136},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4699999988079071},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3962000012397766},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.3813000023365021},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.3481000065803528},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.3319999873638153},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.3167000114917755},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.31450000405311584},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.30379998683929443},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.2971000075340271},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.28999999165534973},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.2696000039577484},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.10941","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10941","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2607.10941","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10941","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"Monadic":[0],"dependence":[1,133],"is":[2,22,98,152],"a":[3,39,88,178],"proposed":[4],"structural":[5,46,143],"dividing":[6],"line":[7],"for":[8,61,173],"fixed-parameter":[9],"tractability":[10],"of":[11,28,48,102,127,145],"first-order":[12,41],"model":[13],"checking":[14],"on":[15,107],"hereditary":[16],"graph":[17,20,63,86,148,163],"classes.":[18,149],"A":[19,76,168],"class":[21,27,55,67,91],"\\emph{monadically":[23],"dependent}":[24],"if":[25],"the":[26,66,73,99,124,128,140],"all":[29],"graphs":[30],"cannot":[31],"be":[32],"interpreted":[33],"in":[34,65,87],"its":[35,110],"vertex-colored":[36],"members":[37],"using":[38],"fixed":[40],"formula.":[42],"We":[43],"prove":[44],"two":[45],"consequences":[47],"monadic":[49,132],"dependence.":[50],"First,":[51],"every":[52,62,69,84,174],"monadically":[53,89,146],"dependent":[54,90,147],"has":[56,80,92],"\\emph{almost":[57],"linear":[58],"neighborhood":[59],"complexity}:":[60],"$G$":[64,164],"and":[68,104,134,138],"set":[70],"$A\\subseteq":[71,175],"V(G)$,":[72,176],"family":[74],"$\\{N_G(v)\\cap":[75],":":[77,169],"v\\in":[78,170],"V(G)\\}$":[79],"size":[81],"$|A|^{1+o(1)}$.":[82],"Second,":[83],"$n$-vertex":[85,162],"radius-1":[93,125,182],"merge-width":[94,97,137,183],"$n^{o(1)}$.":[95],"Here,":[96],"decomposition":[100],"parameter":[101],"Dreier":[103],"Toru\u0144czyk":[105],"based":[106],"construction":[108,179],"sequences;":[109],"radius-$r$":[111],"version":[112],"measures":[113],"local":[114],"reachability":[115],"among":[116],"parts":[117],"through":[118],"already":[119],"resolved":[120],"pairs.":[121],"This":[122],"settles":[123],"case":[126],"conjectured":[129],"connection":[130],"between":[131],"almost":[135],"bounded":[136],"provides":[139],"first":[141],"decomposition-based":[142],"description":[144],"Our":[150],"proof":[151],"algorithmic:":[153],"we":[154],"give":[155],"an":[156,161],"$\\mathcal{O}(n^5)$-time":[157],"algorithm":[158],"that,":[159],"given":[160],"such":[165],"that":[166],"$|\\{N_G(v)\\cap":[167],"V(G)\\}|\\le":[171],"O(|A|^d)$":[172],"computes":[177],"sequence":[180],"witnessing":[181],"$\\mathcal{O}(n^{1-1/d}\\log":[184],"n)$.":[185]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-15T00:00:00"}