{"id":"https://openalex.org/W2992225777","doi":"https://doi.org/10.37236/8488","title":"On 2-Connected Hypergraphs with No Long Cycles","display_name":"On 2-Connected Hypergraphs with No Long Cycles","publication_year":2019,"publication_date":"2019-11-08","ids":{"openalex":"https://openalex.org/W2992225777","doi":"https://doi.org/10.37236/8488","mag":"2992225777"},"language":"en","primary_location":{"id":"doi:10.37236/8488","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8488","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i4p31/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/v26i4p31/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023439517","display_name":"Zolt\u00e1n F\u00fcredi","orcid":"https://orcid.org/0000-0001-7335-991X"},"institutions":[{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n F\u00fcredi","raw_affiliation_strings":["Alfr\u00e9d R\u00e9nyi Institute of Mathematics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","institution_ids":["https://openalex.org/I127817813"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080894223","display_name":"Alexandr Kostochka","orcid":"https://orcid.org/0000-0002-6363-3804"},"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":"Alexandr Kostochka","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":"last","author":{"id":"https://openalex.org/A5079041534","display_name":"Ruth Luo","orcid":"https://orcid.org/0000-0002-4358-9957"},"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":"Ruth Luo","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"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8571,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85035461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","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.9990000128746033,"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.9990000128746033,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9955999851226807,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9939000010490417,"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.8912755250930786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8886245489120483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.831524133682251},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8012179136276245},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.640620231628418},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.49760130047798157},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42963409423828125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33602845668792725},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2056804597377777},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05058473348617554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.04319185018539429}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8912755250930786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8886245489120483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.831524133682251},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8012179136276245},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.640620231628418},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.49760130047798157},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42963409423828125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33602845668792725},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2056804597377777},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05058473348617554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.04319185018539429},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/8488","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8488","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i4p31/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/8488","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8488","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i4p31/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/G1148188478","display_name":null,"funder_award_id":"18-01-","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"},{"id":"https://openalex.org/G1484483809","display_name":null,"funder_award_id":"19-01-00682","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"},{"id":"https://openalex.org/G1664083329","display_name":"Extremal Problems on Graphs Related to Colorings and Cycle Structure","funder_award_id":"1600592","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1886770400","display_name":null,"funder_award_id":"DMS\u20101600592","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G302206780","display_name":null,"funder_award_id":"KH 130371","funder_id":"https://openalex.org/F4320326762","funder_display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal"},{"id":"https://openalex.org/G3933270012","display_name":null,"funder_award_id":"317487","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"},{"id":"https://openalex.org/G524954726","display_name":null,"funder_award_id":"18-01-00353A","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"},{"id":"https://openalex.org/G525927924","display_name":"PostDoctoral Research Fellowship","funder_award_id":"1902808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6621106650","display_name":null,"funder_award_id":"DMS-1902808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7499709116","display_name":null,"funder_award_id":"130371","funder_id":"https://openalex.org/F4320326762","funder_display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"},{"id":"https://openalex.org/F4320326762","display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","ror":null},{"id":"https://openalex.org/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"},{"id":"https://openalex.org/F4320336675","display_name":"National Research, Development and Innovation Office","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2992225777.pdf","grobid_xml":"https://content.openalex.org/works/W2992225777.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1990486130","https://openalex.org/W1996106086","https://openalex.org/W2003298043","https://openalex.org/W2083978161","https://openalex.org/W2121034169","https://openalex.org/W2155085924","https://openalex.org/W2765948135","https://openalex.org/W2820349237","https://openalex.org/W2884098497","https://openalex.org/W2962695057","https://openalex.org/W2963861976","https://openalex.org/W3022022444","https://openalex.org/W6826171367"],"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/W2963081352","https://openalex.org/W2472555608","https://openalex.org/W4376608938","https://openalex.org/W4288275998","https://openalex.org/W4214498971"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,12],"upper":[3],"bound":[4,42,51,66,88],"for":[5,67,91],"the":[6,50,65,68,75],"maximum":[7],"number":[8],"of":[9,21,71,77],"edges":[10],"in":[11],"$n$-vertex":[13],"2-connected":[14],"$r$-uniform":[15],"hypergraph":[16],"with":[17,35],"no":[18],"Berge":[19],"cycle":[20],"length":[22],"$k$":[23],"or":[24],"greater,":[25],"where":[26,74],"$n\\ge":[27,93],"k":[28],"\\ge":[29],"4r\\ge":[30],"12$.":[31],"For":[32,84],"$n$":[33],"large":[34],"respect":[36],"to":[37,63],"$r$":[38],"and":[39,45],"$k$,":[40],"this":[41],"is":[43,46,61,80,89],"sharp":[44,90],"significantly":[47],"stronger":[48],"than":[49],"without":[52],"restrictions":[53],"on":[54],"connectivity.":[55],"It":[56],"turned":[57],"out":[58],"that":[59],"it":[60],"simpler":[62],"prove":[64],"broader":[69],"class":[70],"Sperner":[72],"families":[73],"size":[76],"each":[78],"set":[79],"at":[81],"most":[82],"$r$.":[83],"such":[85],"families,":[86],"our":[87],"all":[92],"k\\geq":[94],"r\\ge":[95],"3$.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}