{"id":"https://openalex.org/W7167078311","doi":"https://doi.org/10.48550/arxiv.2607.00244","title":"Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width","display_name":"Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7167078311","doi":"https://doi.org/10.48550/arxiv.2607.00244"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00244","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00244","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":null,"license_id":null,"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.00244","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139940641","display_name":"\u00c9douard Bonnet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bonnet, \u00c9douard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139920792","display_name":"Ma\u00ebl Dumas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dumas, Ma\u00ebl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011951093","display_name":"Julien Duron","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Duron, Julien","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.5056999921798706,"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.5056999921798706,"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.47909998893737793,"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.0038999998942017555,"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/bounded-function","display_name":"Bounded function","score":0.7505000233650208},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6535999774932861},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5677000284194946},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5059000253677368},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.499099999666214},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.49140000343322754},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4733999967575073},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.40939998626708984},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.399399995803833}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7505000233650208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7264999747276306},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6819999814033508},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6535999774932861},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5715000033378601},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5677000284194946},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5059000253677368},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.499099999666214},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.49140000343322754},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4733999967575073},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.40939998626708984},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.399399995803833},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.36730000376701355},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3596999943256378},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.35010001063346863},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.32580000162124634},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.3140999972820282},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2928999960422516},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2606000006198883},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2549000084400177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C17327563","wikidata":"https://www.wikidata.org/wiki/Q1991405","display_name":"Nowhere dense set","level":3,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00244","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00244","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00244","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00244","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":null,"license_id":null,"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":{"For":[0],"every":[1],"$\\varepsilon":[2],">":[3],"0$,":[4],"Max":[5,93],"Independent":[6,94],"Set":[7,95,159,181,205],"admits":[8],"a":[9,54,71,79,85,115,137,175],"polynomial-time":[10,55,86],"$n^\\varepsilon$-approximation":[11],"algorithm":[12,91,144,178],"on":[13,96,145,160,182,208],"$n$-vertex":[14],"graphs":[15,97,146,161,183,209],"of":[16,53,98,121,129,147,157,162,169,189,215],"effectively":[17,148],"bounded":[18,149,163,190,216],"twin-width":[19,99],"[Berg\u00e9":[20],"et":[21],"al.,":[22],"STACS":[23],"'23].":[24],"The":[25],"approximation":[26,43,56,130],"factor":[27],"actually":[28],"obtained":[29],"is":[30,78,117,171,174,206],"more":[31],"precisely":[32],"$n^{O(1/":[33,140],"\\log":[34,35,89,141,142],"n)}$.":[36],"Prior":[37],"to":[38],"the":[39,51,105,122,126,154,167],"current":[40],"paper,":[41],"no":[42],"hardness":[44,128],"was":[45,59],"known":[46],"for":[47,92,131,179,226],"this":[48,68,199,222],"problem,":[49],"and":[50,193],"existence":[52],"scheme":[57],"(PTAS)":[58],"repeatedly":[60],"raised":[61],"as":[62,119],"an":[63],"open":[64],"question.":[65],"We":[66,74,124,151,197,218],"answer":[67],"question":[69],"in":[70],"strong":[72],"sense:":[73],"show":[75,125,220],"that":[76,84,203,221],"there":[77],"constant":[80],"$\u03b3>":[81],"0$":[82],"such":[83],"$n^{\u03b3/":[87],"(\\log":[88],"n)^2}$-approximation":[90],"at":[100],"most":[101],"4":[102],"would":[103],"refute":[104],"Exponential-Time":[106],"Hypothesis":[107],"(ETH).":[108],"This":[109],"lower":[110],"bound":[111],"further":[112,219],"holds":[113,225],"if":[114],"4-sequence":[116],"provided":[118],"part":[120],"input.":[123],"same":[127],"Min":[132],"Coloring,":[133],"which":[134],"also":[135,152,224],"has":[136],"nearly":[138],"matching":[139],"n)}$-approximation":[143],"twin-width.":[150],"clarify":[153],"parameterized":[155],"complexity":[156],"$k$-Independent":[158,180,204],"radius-$r$":[164],"merge-width":[165],"when":[166],"range":[168],"$r$":[170],"limited.":[172],"There":[173],"fixed-parameter":[176],"tractable":[177],"given":[184,210],"with":[185,211],"radius-$2^{O(k^2)}$":[186],"merge":[187,213],"sequences":[188,214],"width":[191],"[Dreier":[192],"Toru\u0144czyk,":[194],"STOC":[195],"'25].":[196],"complement":[198],"result":[200,223],"by":[201],"showing":[202],"W[1]-hard":[207],"radius-$o(k)$":[212],"width.":[217],"$k$-Dominating":[227],"Set.":[228]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}