{"id":"https://openalex.org/W7131671453","doi":"https://doi.org/10.37236/14036","title":"Large Matchings and nearly Spanning, nearly Regular Subgraphs of Random Subgraphs","display_name":"Large Matchings and nearly Spanning, nearly Regular Subgraphs of Random Subgraphs","publication_year":2026,"publication_date":"2026-02-26","ids":{"openalex":"https://openalex.org/W7131671453","doi":"https://doi.org/10.37236/14036"},"language":"en","primary_location":{"id":"doi:10.37236/14036","is_oa":true,"landing_page_url":"https://doi.org/10.37236/14036","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p37/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p37/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126938003","display_name":"Sahar Diskin","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Sahar Diskin","raw_affiliation_strings":["Tel-Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028299034","display_name":"Joshua Erde","orcid":"https://orcid.org/0000-0003-1129-4270"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joshua Erde","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123409874","display_name":"Mihyun Kang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mihyun Kang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126926400","display_name":"Michael Krivelevich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Krivelevich","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5126938003"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53559511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"1","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.9623000025749207,"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.9623000025749207,"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.00860000029206276,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.005100000184029341,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5254999995231628},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5084999799728394},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.49939998984336853},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.475600004196167},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4602999985218048},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4505000114440918},{"id":"https://openalex.org/keywords/random-regular-graph","display_name":"Random regular graph","score":0.4390000104904175}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7932000160217285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7827000021934509},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5254999995231628},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5084999799728394},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47760000824928284},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.475600004196167},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4602999985218048},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4505000114440918},{"id":"https://openalex.org/C4255713","wikidata":"https://www.wikidata.org/wiki/Q7291988","display_name":"Random regular graph","level":5,"score":0.4390000104904175},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.321399986743927},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.29919999837875366},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.2718000113964081}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/14036","is_oa":true,"landing_page_url":"https://doi.org/10.37236/14036","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p37/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8d68516c-3fdc-4751-9aa3-9519cc4714cb","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/8d68516c-3fdc-4751-9aa3-9519cc4714cb","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Diskin, S, Erde, J, Kang, M & Krivelevich, M 2026, 'Large Matchings and nearly Spanning, nearly Regular Subgraphs of Random Subgraphs', The Electronic Journal of Combinatorics, vol. 33, no. 1, P1.37. https://doi.org/10.37236/14036","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.37236/14036","is_oa":true,"landing_page_url":"https://doi.org/10.37236/14036","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p37/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2447788411","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G3899648691","display_name":null,"funder_award_id":"10.55776/P","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G4565348239","display_name":null,"funder_award_id":"10.55776/F1002","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320310430","display_name":"TU Graz, Internationale Beziehungen und Mobilit\u00e4tsprogramme","ror":"https://ror.org/00d7xrm67"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131671453.pdf","grobid_xml":"https://content.openalex.org/works/W7131671453.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,31,48,68,82],"graph":[2,50],"$G$":[3,18,46],"and":[4,51],"$p\\in":[5],"[0,1]$,":[6],"the":[7,36,91,124],"random":[8],"subgraph":[9,112],"$G_p$":[10,71,108],"is":[11],"obtained":[12],"by":[13],"retaining":[14],"each":[15],"edge":[16],"of":[17,85],"independently":[19],"with":[20,56,98],"probability":[21,57,99],"$p$.":[22],"We":[23,77],"show":[24,79],"that":[25,35,80],"for":[26,81,94],"every":[27],"$\\epsilon>0$,":[28],"there":[29,66],"exists":[30,67],"constant":[32],"$C>0$":[33],"such":[34],"following":[37],"holds.":[38],"Let":[39],"$d\\ge":[40],"C$":[41],"be":[42,47],"an":[43,110],"integer,":[44],"let":[45,52],"$d$-regular":[49,86],"$p\\ge":[53,96],"\\frac{C}{d}$.":[54],"Then,":[55],"tending":[58,100],"to":[59,64,101,106],"one":[60,102],"as":[61,103],"$|V(G)|$":[62],"tends":[63,105],"infinity,":[65,107],"matching":[69],"in":[70],"covering":[72],"at":[73,114],"least":[74,115],"$(1-\\epsilon)|V(G)|$":[75],"vertices.":[76],"further":[78],"wide":[83],"family":[84],"graphs":[87],"$G$,":[88],"which":[89],"includes":[90],"$d$-dimensional":[92],"hypercube,":[93],"any":[95],"\\frac{\\log^5d}{d}$":[97],"$d$":[104],"contains":[109],"induced":[111],"on":[113],"$(1-o(1))|V(G)|$":[116],"vertices,":[117],"whose":[118],"degrees":[119],"are":[120],"tightly":[121],"concentrated":[122],"around":[123],"expected":[125],"average":[126],"degree":[127],"$dp$.":[128]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2026-02-27T00:00:00"}