{"id":"https://openalex.org/W7224927634","doi":"https://doi.org/10.48550/arxiv.2610.40369","title":"Half-Optimal Induced Matchings in Random Graphs: Online and Low-Degree Algorithms","display_name":"Half-Optimal Induced Matchings in Random Graphs: Online and Low-Degree Algorithms","publication_year":2026,"publication_date":"2026-10-29","ids":{"openalex":"https://openalex.org/W7224927634","doi":"https://doi.org/10.48550/arxiv.2610.40369"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.40369","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40369","pdf_url":"https://arxiv.org/pdf/2610.40369","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.40369","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047573205","display_name":"Abhishek Dhawan","orcid":"https://orcid.org/0000-0003-1971-7733","observed_orcids":["https://orcid.org/0000-0003-1971-7733","https://orcid.org/0000-0001-6832-6742"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dhawan, Abhishek","raw_affiliation_strings":["Department of Mathematics , University of Illinois Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029207194","display_name":"Eren C. K\u0131z\u0131lda\u011f","orcid":"https://orcid.org/0000-0003-0411-7161","observed_orcids":["https://orcid.org/0000-0003-0411-7161"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K\u0131z\u0131lda\u011f, Eren C.","raw_affiliation_strings":["Department of Statistics , University of Illinois Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics , University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059255047","display_name":"Neeladri Maitra","orcid":"https://orcid.org/0009-0005-1247-0266","observed_orcids":["https://orcid.org/0009-0005-1247-0266"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maitra, Neeladri","raw_affiliation_strings":["Department of Mathematics , University of Illinois Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100950330","display_name":"Cheng Mao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mao, Cheng","raw_affiliation_strings":["School of Mathematics , Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics , Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048663183","display_name":"Timothy Wee","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wee, Timothy L. H.","raw_affiliation_strings":["School of Mathematics , Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics , Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.8838000297546387,"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.8838000297546387,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0786999985575676,"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/T12288","display_name":"Optimization and Search Problems","score":0.014600000344216824,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/induced-matchings","display_name":"induced matchings","score":0.9769999980926514},{"id":"https://openalex.org/keywords/erdos-renyi-graphs","display_name":"Erd\u0151s-R\u00e9nyi random graphs","score":0.9480000138282776},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.5860000252723694},{"id":"https://openalex.org/keywords/approximation-gap","display_name":"approximation gap","score":0.4519999921321869},{"id":"https://openalex.org/keywords/sharp-threshold","display_name":"sharp threshold","score":0.5059999823570251},{"id":"https://openalex.org/keywords/overlap-gap-property","display_name":"overlap gap property","score":0.8769999742507935},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.6499999761581421},{"id":"https://openalex.org/keywords/sparse-random-graphs","display_name":"sparse random graphs","score":0.5669999718666077},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"average-case complexity","score":0.4740000069141388},{"id":"https://openalex.org/keywords/independent-set-problem","display_name":"independent set problem","score":0.460999995470047}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6664000153541565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6001999974250793},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5849999785423279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5666000247001648},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5493000149726868},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.531000018119812},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4569999873638153},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3977999985218048},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2770000100135803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27570000290870667},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.40369","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40369","pdf_url":"https://arxiv.org/pdf/2610.40369","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.40369","doi":"https://doi.org/10.48550/arxiv.2610.40369","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.40369","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,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.40369","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40369","pdf_url":"https://arxiv.org/pdf/2610.40369","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2362927321","display_name":"RTG: Research in Combinatorics","funder_award_id":"1937241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4387692696","display_name":"CAREER: Statistical Inference on Random Graphs and Hypergraphs: Geometry, Combinatorics, and Computation","funder_award_id":"2338062","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7224927634.pdf","grobid_xml":"https://content.openalex.org/works/W7224927634.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1970411956","https://openalex.org/W3015843841","https://openalex.org/W1585379182","https://openalex.org/W2110009764","https://openalex.org/W2198764752","https://openalex.org/W7096226929","https://openalex.org/W7160428101","https://openalex.org/W2017458202","https://openalex.org/W2489430093","https://openalex.org/W1886155114"],"abstract_inverted_index":{"For":[0,179,217],"many":[1],"optimization":[2],"problems":[3],"on":[4,140],"random":[5,46],"graphs,":[6],"most":[7],"prominently":[8],"the":[9,19,49,79,125,133,168,230],"largest":[10,80],"independent":[11],"set":[12],"problem,":[13],"natural":[14],"algorithms":[15,131],"reach":[16],"only":[17],"half":[18],"optimum,":[20],"and":[21,112,159,211,224],"such":[22,36],"factor-two":[23],"gaps":[24],"are":[25],"known":[26],"to":[27,55,174],"be":[28,56],"sharp":[29,135],"within":[30],"broad":[31],"algorithmic":[32],"classes.":[33],"We":[34,166],"prove":[35],"a":[37,53,59,141,155,163,202,222,238,250],"gap":[38,186],"for":[39],"finding":[40],"large":[41],"induced":[42,57,81,98,149,157],"matchings":[43],"in":[44],"Erd\u0151s-R\u00e9nyi":[45],"graphs.":[47],"In":[48,73,124],"worst":[50],"case,":[51],"requiring":[52],"matching":[54,82,99,150,158],"turns":[58],"polynomial-time":[60],"solvable":[61],"problem":[62],"into":[63],"an":[64,70,97],"NP-hard":[65],"one;":[66],"our":[67,160],"results":[68],"reveal":[69],"average-case":[71],"counterpart.":[72],"$G(n,p)$":[74],"with":[75,86,108,121,144,188],"$C/n\\le":[76],"p\\le":[77],"1-\u03ba$,":[78],"has":[83],"size":[84,101,118],"$(1+o(1))L$":[85],"high":[87,145],"probability,":[88,146],"where":[89],"$L=\\log_{1/(1-p)}(np)$.":[90],"A":[91],"simple":[92],"online":[93,105,218],"greedy":[94,176],"algorithm":[95,162],"finds":[96,115],"of":[100,117,233],"$(1/2-\u03b5)L$,":[102],"while":[103],"no":[104,214],"algorithm,":[106],"even":[107],"adaptive":[109],"inspection":[110],"order":[111],"unbounded":[113],"computation,":[114],"one":[116],"$(1/2+\u03b5)L$":[119],"except":[120],"probability":[122],"$\\exp(-\u03a9(L\\log(np)))$.":[123],"sparse":[126],"regime":[127],"$p=d/n$,":[128],"low-degree":[129,161,180],"polynomial":[130],"exhibit":[132],"same":[134],"threshold.":[136],"Our":[137],"guarantees":[138],"rest":[139],"maximality":[142],"principle:":[143],"every":[147],"maximal":[148,156],"is":[151],"half-optimal.":[152],"Greedy":[153],"outputs":[154],"near-maximal":[164],"one.":[165],"bypass":[167],"delicate":[169],"coupling":[170],"arguments":[171],"classically":[172],"used":[173,209],"analyze":[175],"since":[177,201],"Karp.":[178],"hardness,":[181,219],"we":[182,220],"adapt":[183],"Wein's":[184],"overlap":[185],"argument,":[187],"forbidden":[189],"structures":[190],"that":[191,228],"track":[192],"overlaps":[193],"between":[194],"endpoint":[195],"sets":[196],"rather":[197],"than":[198],"edge":[199,204],"sets,":[200],"new":[203,223],"may":[205],"join":[206],"two":[207],"previously":[208],"endpoints":[210],"thus":[212],"encounter":[213],"fresh":[215],"randomness.":[216],"give":[221],"significantly":[225],"simpler":[226],"argument":[227],"avoids":[229],"correlated":[231],"instances":[232],"prior":[234],"OGP-based":[235],"proofs:":[236],"at":[237],"suitable":[239],"stopping":[240],"time,":[241],"all":[242],"pairs":[243],"involving":[244],"uninspected":[245],"vertices":[246],"remain":[247],"unrevealed,":[248],"so":[249],"direct":[251],"first-moment":[252],"bound":[253],"suffices.":[254]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-10-31T00:00:00"}