The Erdős-Gallai Theorem states that for k ≥ 3 every graph on n vertices with more than 1 2 (k − 1)(n − 1) edges contains a cycle of length at least k. Kopylov proved a strengthening of this result for 2-connected graphs with extremal examples H n,k,t and H n,k,2 . In this note, we generalize the result of Kopylov to bound the number of s-cliques in a graph with circumference less than k. Furthermore, we show that the same extremal examples that maximize the number of edges also maximize the number of cliques of any fixed size. Finally, we obtain the extremal number of s-cliques in a graph with no path on k-vertices.Mathematics Subject Classification: 05C35, 05C38.

Let n ≥ k ≥ r + 3 and H be an n-vertex r-uniform hypergraph. We show that ifthen H contains a Berge cycle of length at least k. This bound is tight when k − 2 divides n − 1.We also show that the bound is attained only for connected r-uniform hypergraphs in which every block is the complete hypergraph K (r) k−1 . We conjecture that our bound also holds in the case k = r + 2, but the case of short cycles, k ≤ r + 1, is different.Mathematics Subject Classification: 05D05, 05C65, 05C38, 05C35.

The Erdős-Gallai Theorem states that for k ≥ 3, any n-vertex graph with no cycle of length at least k has at most 1 2 (k −1)(n−1) edges. A stronger version of the Erdős-Gallai Theorem was given by Kopylov: If G is a 2-connected n-vertex graph with no cycle of length at least k, then e(G) ≤ max{h(n, k, 2), h(n, k, k−1 2

No abstract

We show that for each k ≥ 4 and n > r ≥ k + 1, every n-vertex r-uniform hypergraph with no Berge cycle of length at least k has at most (k−1)(n−1) r edges. The bound is exact, and we describe the extremal hypergraphs. This implies and slightly refines the theorem of Győri, Katona and Lemons that for n > r ≥ k ≥ 3, every n-vertex r-uniform hypergraph with no Berge path of length k has at most (k−1)n r+1 edges. To obtain the bounds, we study bipartite graphs with no cycles of length at least 2k, and then translate the results into the language of multi-hypergraphs.Mathematics Subject Classification: 05C35, 05C38.Later, the remaining case k = r + 1 was resolved by Davoodi, Győri, Methuku, and Tompkins.Theorem 1.5 (Davoodi, Győri, Methuku and Tompkins [1]). Let k = r + 1 > 2, and let H be an n-vertex r-graph with no Berge-path of length k. Then e(H) ≤ n.Furthermore, the bounds in these three theorems are sharp for each k and r for infinitely many n.Very recently, several interesting results were obtained for Berge paths and cycles for k ≥ r + 1. First, Győri, Methuku, Salia, Tompkins, and Vizer [9] proved an asymptotic version of the Erdős-Gallai theorem for Berge-paths in connected hypergraphs whenever r is fixed and n and k tend to infinity. For Berge-cycles, the exact result for k ≥ r + 3 was obtained in [5]: Theorem 1.6 (Füredi, Kostochka and Luo [5]). Let k ≥ r + 3 ≥ 6, and let H be an n-vertex r-graph with no Berge-cycles of length k or longer. Then e(H) ≤ n−1 k−2 k−1 r . This theorem is a hypergraph version of Theorem 1.2 and an analog of Theorem 1.4. It also somewhat refines Theorem 1.4 for k ≥ r + 3. Later, Ergemlidze, Győri, Methuku, Salia, Thompkins, and Zamora [3] extended the results to to k ∈ {r + 1, r + 2}: Theorem 1.7 (Ergemlidze et al. [3]). If k ≥ 4 and H is an n-vertex r-graph with no Berge-cycles of length k or longer, then k = r + 1 and e(H) ≤ n − 1, or k = r + 2 and e(H) ≤ n−1 k−2 k−1 r .The goal of this paper is to prove a hypergraph version of Theorem 1.2 for r-graphs with no Berge-cycles of length k or longer in the case k ≤ r. Our result is an analog of Theorem 1.3 and yields a refinement of it.Our approach is to consider bipartite graphs in which the vertices in one of the parts have degrees at least r, and to analyze the structure of such graphs with circumference less than 2k. After that, we apply the obtained results to the incidence graphs of r-uniform hypergraphs. In this way, our methods differ from those of [8],[1], [9], and [5]. Notation and results Hypergraph notationThe lower rank of a multi-hypergraph H is the size of a smallest edge of H.In view of the structure of our proof, it is more convenient to consider hypergraphs with lower rank at least r instead of r-uniform hypergraphs. It also yields formally stronger statements of the results.The incidence graph G(H) of a multi-hypergraph H = (V, E) is the bipartite graph with parts V and E where v ∈ V is adjacent to e ∈ E iff in H vertex v belongs to edge e.There are several versions of connectivity of hypergraphs. We will call a m...