{"id":"https://openalex.org/W4388304291","doi":"https://doi.org/10.37236/11328","title":"On the Maximum $F_5$-Free Subhypergraphs of a Random Hypergraph","display_name":"On the Maximum $F_5$-Free Subhypergraphs of a Random Hypergraph","publication_year":2023,"publication_date":"2023-11-03","ids":{"openalex":"https://openalex.org/W4388304291","doi":"https://doi.org/10.37236/11328"},"language":"en","primary_location":{"id":"doi:10.37236/11328","is_oa":true,"landing_page_url":"http://dx.doi.org/10.37236/11328","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i4p22/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/v30i4p22/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004578613","display_name":"Igor Ara\u00fajo","orcid":"https://orcid.org/0000-0002-8238-6597"},"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":"Igor Araujo","raw_affiliation_strings":["University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108264183","display_name":"J\u00f3zsef Balogh","orcid":null},"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":"J\u00f3zsef Balogh","raw_affiliation_strings":["Department of Mathematics, University of Illinois Urbana-Champaign, Urbana, Illinois 61801, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois Urbana-Champaign, Urbana, Illinois 61801, USA,","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101634507","display_name":"Haoran Luo","orcid":"https://orcid.org/0000-0002-1951-6678"},"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":"Haoran Luo","raw_affiliation_strings":["Department of Mathematics, University of Illinois Urbana-Champaign, Urbana, Illinois 61801, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois Urbana-Champaign, Urbana, Illinois 61801, USA,","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2709097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"4","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.9991000294685364,"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.9991000294685364,"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.9847000241279602,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9628999829292297,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9140231609344482},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9016855955123901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8684678077697754},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6695045232772827},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6322121024131775},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6110581159591675},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4424769878387451},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3774954080581665},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12421703338623047},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05875489115715027}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9140231609344482},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9016855955123901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8684678077697754},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6695045232772827},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6322121024131775},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6110581159591675},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4424769878387451},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3774954080581665},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12421703338623047},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05875489115715027},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/11328","is_oa":true,"landing_page_url":"http://dx.doi.org/10.37236/11328","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i4p22/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/11328","is_oa":true,"landing_page_url":"http://dx.doi.org/10.37236/11328","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i4p22/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/G154586071","display_name":null,"funder_award_id":"DMS-1937241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4036205396","display_name":"Global and Local Properties of Discrete Structures","funder_award_id":"1764123","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4633044258","display_name":null,"funder_award_id":"RTG DMS-1937241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6180903566","display_name":null,"funder_award_id":"RB 22000","funder_id":"https://openalex.org/F4320332222","funder_display_name":"University of Illinois at Urbana-Champaign"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388304291.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1509611772","https://openalex.org/W1566250144","https://openalex.org/W1577085578","https://openalex.org/W2022933371","https://openalex.org/W2034838716","https://openalex.org/W2041862771","https://openalex.org/W2087686829","https://openalex.org/W2102028311","https://openalex.org/W2964207251","https://openalex.org/W3038100514","https://openalex.org/W3103981711","https://openalex.org/W6631369595","https://openalex.org/W6820348119"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W1983915440","https://openalex.org/W2025239573","https://openalex.org/W2158905189","https://openalex.org/W4319874546","https://openalex.org/W3095925971"],"abstract_inverted_index":{"Denote":[0],"by":[1],"$F_5$":[2],"the":[3,74],"$3$-uniform":[4],"hypergraph":[5],"on":[6],"vertex":[7],"set":[8],"$\\{1,2,3,4,5\\}$":[9],"with":[10,41,54,112],"hyperedges":[11],"$\\{123,124,345\\}$.":[12],"Balogh,":[13],"Butterfield,":[14],"Hu,":[15],"and":[16,44],"Lenz":[17],"proved":[18],"that":[19,46,65,88],"if":[20,47,89],"$p":[21,90],">":[22,91],"K":[23],"\\log":[24],"n":[25],"/n$":[26],"for":[27,97],"some":[28,98],"large":[29,99],"constant":[30,84,100],"$K$,":[31],"then":[32,53,102],"every":[33,103],"maximum":[34,60,104],"$F_5$-free":[35,61,105],"subhypergraph":[36,62,106],"of":[37,63,107],"$G^3(n,p)$":[38],"is":[39,66,110],"tripartite":[40,111],"high":[42,55,113],"probability,":[43],"showed":[45],"$p_0":[48],"=":[49],"0.1\\sqrt{\\log":[50],"n}":[51,94],"/n$,":[52],"probability":[56],"there":[57],"exists":[58],"a":[59,83],"$G^3(n,p_0)$":[64],"not":[67],"tripartite.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72],"sharpen":[73],"upper":[75],"bound":[76],"to":[77,82],"be":[78],"best":[79],"possible":[80],"up":[81],"factor.":[85],"We":[86],"prove":[87],"C":[92],"\\sqrt{\\log":[93],"/n":[95],"$":[96],"$C$,":[101],"$G^3(n,":[108],"p)$":[109],"probability.":[114]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}