{"id":"https://openalex.org/W7160428101","doi":"https://doi.org/10.48550/arxiv.2605.03893","title":"Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs","display_name":"Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160428101","doi":"https://doi.org/10.48550/arxiv.2605.03893"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03893","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03893","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.2605.03893","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135447717","display_name":"David Gamarnik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gamarnik, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080680637","display_name":"Mikl\u00f3s Z. R\u00e1cz","orcid":"https://orcid.org/0000-0002-8948-2426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R\u00e1cz, Mikl\u00f3s Z.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135484320","display_name":"Gabe Schoenbach","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schoenbach, Gabe","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.7149999737739563,"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.7149999737739563,"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.11840000003576279,"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.022600000724196434,"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/simple","display_name":"Simple (philosophy)","score":0.5267999768257141},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5034000277519226},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45410001277923584},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.450300008058548},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4404999911785126},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.4309999942779541},{"id":"https://openalex.org/keywords/chatterjee","display_name":"Chatterjee","score":0.39399999380111694},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.38260000944137573}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6258999705314636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5979999899864197},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5034000277519226},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4271000027656555},{"id":"https://openalex.org/C2779379073","wikidata":"https://www.wikidata.org/wiki/Q5087932","display_name":"Chatterjee","level":3,"score":0.39399999380111694},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3783999979496002},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.35280001163482666},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.3244999945163727},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.29510000348091125},{"id":"https://openalex.org/C17902559","wikidata":"https://www.wikidata.org/wiki/Q17099734","display_name":"Restricted isometry property","level":3,"score":0.2797999978065491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27630001306533813},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03893","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03893","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.2605.03893","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03893","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,43],"study":[1],"the":[2,27,118,124,128,134],"problem":[3,111,129],"of":[4,11,32,57,61,83,87,127,133],"efficiently":[5],"finding":[6],"large":[7],"common":[8,29,54,80],"induced":[9,30,55,81],"subgraphs":[10],"two":[12],"independent":[13],"Erd\u0151s--R\u00e9nyi":[14],"random":[15],"graphs":[16],"$G_1,":[17],"G_2":[18],"\\sim":[19],"\\mathbb{G}(n,1/2)$.":[20],"Recently,":[21],"Chatterjee":[22],"and":[23,34,59,85,140,150,155],"Diaconis":[24],"showed":[25],"that":[26,46,73,109,123,152],"largest":[28],"subgraph":[31,56,82],"$G_1$":[33,58,84],"$G_2$":[35,60,86],"has":[36],"size":[37,62,88],"$(4-o(1))\\log_2":[38],"n$":[39,65,93],"with":[40,66,94],"high":[41,67],"probability.":[42,68],"first":[44],"show":[45,122],"a":[47,53,79,113,131],"simple":[48],"greedy":[49],"online":[50,75,156],"algorithm":[51,76],"finds":[52],"$(2-o(1))":[63],"\\log_2":[64,92],"Our":[69],"main":[70],"result":[71],"shows":[72],"no":[74],"can":[77],"find":[78],"at":[89],"least":[90],"$(2+\\varepsilon)":[91],"probability":[95],"bounded":[96],"away":[97],"from":[98],"$0$":[99],"as":[100],"$n":[101],"\\to":[102],"\\infty$.":[103],"Together,":[104],"these":[105],"results":[106],"provide":[107],"evidence":[108],"this":[110],"exhibits":[112,130],"computation-to-optimization":[114],"gap.":[115],"To":[116],"prove":[117],"impossibility":[119],"result,":[120],"we":[121],"solution":[125],"space":[126],"version":[132],"(multi)":[135],"overlap":[136],"gap":[137],"property":[138],"(OGP),":[139],"utilize":[141],"an":[142],"interpolation":[143],"argument":[144],"recently":[145],"developed":[146],"by":[147],"Gamarnik,":[148],"Kizilda\u011f,":[149],"Warnke":[151],"connects":[153],"OGP":[154],"algorithms.":[157]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-07T00:00:00"}