On 2-connected hypergraphs with no long cycles

Füredi, Zoltán and Kostochka, Alexandr and Luo, Ruth (2019) On 2-connected hypergraphs with no long cycles. The Electronic Journal of Combinatorics, 26 (4). pp. 1-33. ISSN 1077-8926

Preview

Text 1901.pdf Available under License Creative Commons Attribution. Download (503kB) | Preview

Abstract

We give an upper bound for the maximum number of edges in an n-vertex 2-connected r -uniform hypergraph with no Berge cycle of length k or greater, where n >= k 4r >= 12. For n large with respect to r and k, this bound is sharp and is significantly stronger than the bound without restrictions on connectivity. It turned out that it is simpler to prove the bound for the broader class of Sperner families where the size of each set is at most r. For such families, our bound is sharp for all n >= k >= r 3.

Actions (login required)

Edit Item