{"id":"https://openalex.org/W7125419872","doi":"https://doi.org/10.37236/13447","title":"Creating Subgraphs in Semi-Random Hypergraph Games","display_name":"Creating Subgraphs in Semi-Random Hypergraph Games","publication_year":2026,"publication_date":"2026-01-22","ids":{"openalex":"https://openalex.org/W7125419872","doi":"https://doi.org/10.37236/13447"},"language":"en","primary_location":{"id":"doi:10.37236/13447","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13447","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p22/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/v33i1p22/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":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Natalie Behague","raw_affiliation_strings":["University of Warwick"],"affiliations":[{"raw_affiliation_string":"University of Warwick","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079925942","display_name":"Pawe\u0142 Pra\u0142at","orcid":"https://orcid.org/0000-0001-9176-8493"},"institutions":[{"id":"https://openalex.org/I184430034","display_name":"Toronto Public Health","ror":"https://ror.org/010g03x11","country_code":"CA","type":"government","lineage":["https://openalex.org/I184430034"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Pra\u0142at","raw_affiliation_strings":["Toronto"],"affiliations":[{"raw_affiliation_string":"Toronto","institution_ids":["https://openalex.org/I184430034"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123585336","display_name":"Andrzej Ruci\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I59411706","display_name":"Adam Mickiewicz University in Pozna\u0144","ror":"https://ror.org/04g6bbq64","country_code":"PL","type":"education","lineage":["https://openalex.org/I59411706"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Andrzej Ruci\u0144ski","raw_affiliation_strings":["Adam Mickiewicz University"],"affiliations":[{"raw_affiliation_string":"Adam Mickiewicz University","institution_ids":["https://openalex.org/I59411706"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036494857"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2491277,"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.8061000108718872,"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.8061000108718872,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.09049999713897705,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.012799999676644802,"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/hypergraph","display_name":"Hypergraph","score":0.913100004196167},{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.588699996471405},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5684000253677368},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5297999978065491},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.40389999747276306},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.34869998693466187},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.33880001306533813}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.913100004196167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7551000118255615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7163000106811523},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.588699996471405},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5684000253677368},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5297999978065491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5199999809265137},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2791999876499176},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.27549999952316284},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2578999996185303},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/13447","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13447","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p22/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:doras.dcu.ie:32433","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-6616-1606>","pdf_url":null,"source":{"id":"https://openalex.org/S4306401511","display_name":"Dublin City University Open Access Institutional Repository (Dublin City University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I42934936","host_organization_name":"Dublin City University","host_organization_lineage":["https://openalex.org/I42934936"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":{"id":"doi:10.37236/13447","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13447","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p22/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":[],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7125419872.pdf","grobid_xml":"https://content.openalex.org/works/W7125419872.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,55],"semi-random":[1,10],"hypergraph":[2,32,123],"process":[3],"is":[4,45,86,113],"a":[5,19,39,59,77,116],"natural":[6],"generalisation":[7],"of":[8,17,41,61,134,142,145],"the":[9,48,67,73,83,89,107,110,126,129,132,143,148,181,191],"graph":[11,81,90],"process,":[12],"which":[13],"can":[14],"be":[15],"thought":[16],"as":[18,99,102],"one":[20],"player":[21,49,56],"game.":[22],"For":[23,76],"fixed":[24,78,122],"$r":[25],"<":[26,153],"s$,":[27,154],"starting":[28],"with":[29,95],"an":[30,120],"empty":[31],"on":[33,106,161],"$n$":[34],"vertices,":[35],"in":[36,98,140,175],"each":[37],"round":[38],"set":[40,60],"$r$":[42],"vertices":[43,63],"$U$":[44],"presented":[46],"to":[47,72,87,91,114,119],"independently":[50],"and":[51,65,158,167,183,205],"uniformly":[52],"at":[53],"random.":[54],"then":[57],"selects":[58],"$s-r$":[62],"$V$":[64],"adds":[66],"hyperedge":[68],"$U":[69],"\\cup":[70],"V$":[71],"$s$-uniform":[74],"hypergraph.":[75],"(monotone)":[79],"increasing":[80],"property,":[82],"player's":[84,111],"objective":[85,112],"force":[88],"satisfy":[92],"this":[93,162],"property":[94],"high":[96],"probability":[97],"few":[100],"rounds":[101,135],"possible.":[103],"We":[104,177,187],"focus":[105],"case":[108,127,149],"where":[109,180],"construct":[115],"subgraph":[117],"isomorphic":[118],"arbitrary,":[121],"$H$.":[124,146],"In":[125,147],"$r=1$":[128],"threshold":[130,163],"for":[131,164,173,202],"number":[133],"required":[136],"was":[137],"already":[138],"known":[139],"terms":[141],"degeneracy":[144],"$2":[150],"\\le":[151],"r":[152],"we":[155],"give":[156],"upper":[157,171,182],"lower":[159,184,192],"bounds":[160,172,185,193],"general":[165],"$H$,":[166],"find":[168],"further":[169],"improved":[170],"cliques":[174],"particular.":[176],"identify":[178],"cases":[179],"match.":[186],"also":[188],"demonstrate":[189],"that":[190],"are":[194],"not":[195],"always":[196],"tight":[197],"by":[198],"finding":[199],"exact":[200],"thresholds":[201],"various":[203],"paths":[204],"cycles.":[206]},"counts_by_year":[],"updated_date":"2026-03-23T07:41:27.035349","created_date":"2026-01-23T00:00:00"}