{"id":"https://openalex.org/W3199832108","doi":"https://doi.org/10.37236/11859","title":"Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs","display_name":"Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs","publication_year":2024,"publication_date":"2024-09-20","ids":{"openalex":"https://openalex.org/W3199832108","doi":"https://doi.org/10.37236/11859","mag":"3199832108"},"language":"en","primary_location":{"id":"doi:10.37236/11859","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11859","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i3p30/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/v31i3p30/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036494857","display_name":"Natalie Behague","orcid":"https://orcid.org/0000-0001-6616-1606"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Natalie Behague","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037471767","display_name":"Trent G. Marbach","orcid":"https://orcid.org/0000-0002-3708-3095"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trent Marbach","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079925942","display_name":"Pawe\u0142 Pra\u0142at","orcid":"https://orcid.org/0000-0001-9176-8493"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Pra\u0142at","raw_affiliation_strings":["Department of Mathematics\r\nRyerson University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics\r\nRyerson University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078267731","display_name":"Andrzej Ruci\u0144ski","orcid":"https://orcid.org/0000-0002-0742-7694"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrzej Ruci\u0144ski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1646,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86776879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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.9819999933242798,"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/generalization","display_name":"Generalization","score":0.6698698997497559},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.6141746044158936},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5240588188171387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5016934871673584},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4999105930328369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.465880811214447},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45031335949897766},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4074040949344635},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40595531463623047},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3541143238544464},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17944499850273132},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.15763461589813232},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06198912858963013}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6698698997497559},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.6141746044158936},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5240588188171387},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5016934871673584},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4999105930328369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.465880811214447},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45031335949897766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4074040949344635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40595531463623047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3541143238544464},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17944499850273132},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.15763461589813232},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06198912858963013},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/11859","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11859","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i3p30/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"}],"best_oa_location":{"id":"doi:10.37236/11859","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11859","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i3p30/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/G2000533640","display_name":null,"funder_award_id":"2018/29/B/ST1/00426","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3199832108.pdf","grobid_xml":"https://content.openalex.org/works/W3199832108.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2615008404","https://openalex.org/W2981917538","https://openalex.org/W3001179876","https://openalex.org/W3084572114","https://openalex.org/W3196392570"],"related_works":["https://openalex.org/W231720905","https://openalex.org/W1482551403","https://openalex.org/W2532922352","https://openalex.org/W2128390795","https://openalex.org/W2915540008","https://openalex.org/W2604893261","https://openalex.org/W3002471523","https://openalex.org/W3108150460","https://openalex.org/W3102805201","https://openalex.org/W2793671626"],"abstract_inverted_index":{"The":[0,33],"semi-random":[1,167],"graph":[2,13,53,64,92],"process":[3,170],"is":[4,23,60,126,137,147],"a":[5,20,38,50,85,166],"single-player":[6],"game":[7],"that":[8,107,134,145],"begins":[9],"with":[10,69],"an":[11,89],"empty":[12],"on":[14,80],"$n$":[15],"vertices.":[16],"In":[17,94,153],"each":[18],"round,":[19],"vertex":[21,39],"$u$":[22],"presented":[24],"to":[25,46,61,65,88,165],"the":[26,43,47,55,58,63,81,127],"player":[27,34,59],"independently":[28],"and":[29,41,143],"uniformly":[30],"at":[31],"random.":[32],"then":[35],"adaptively":[36],"selects":[37],"$v$":[40],"adds":[42],"edge":[44],"$uv$":[45],"graph.":[48],"For":[49],"fixed":[51,91],"monotone":[52],"property,":[54],"objective":[56],"of":[57,83],"force":[62],"satisfy":[66],"this":[67,135,154,158],"property":[68],"high":[70],"probability":[71],"in":[72,115],"as":[73,76,160],"few":[74],"rounds":[75],"possible.":[77],"We":[78],"focus":[79],"problem":[82],"constructing":[84],"subgraph":[86],"isomorphic":[87],"arbitrary,":[90],"$H$.":[93,152],"[Ben-Eliezer":[95],"et":[96],"al.,":[97],"Random":[98],"Struct.":[99],"Algorithms,":[100],"2020,":[101],"6(3):648\u2013":[102],"675],":[103],"it":[104,146],"was":[105,131],"proved":[106,133],"asymptotically":[108],"almost":[109],"surely":[110],"one":[111],"can":[112],"construct":[113],"$H$":[114],"$t$":[116],"rounds,":[117],"for":[118,139,149,171],"any":[119],"$t\\gg":[120],"n^{(d-1)/d}$":[121],"where":[122],"$d":[123],"\\ge":[124],"2$":[125],"degeneracy":[128],"of~$H$.":[129],"It":[130],"also":[132],"result":[136],"sharp":[138],"$H":[140],"=":[141],"K_{d+1}$":[142],"conjectured":[144],"so":[148],"all":[150],"graphs":[151],"paper":[155],"we":[156],"prove":[157],"conjecture,":[159],"well":[161],"as,":[162],"its":[163],"generalization":[164],"$s$-uniform":[168],"hypergraph":[169],"every":[172],"$s\\ge2$.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}