---
abstract: |
    For a graph $F$, we say a hypergraph is a Berge-$F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is a Berge-$F$. The weight of a non-uniform hypergraph ${\mathcal{H}}$ is the quantity $\sum_{h \in E({\mathcal{H}})} {\left\lvert{h}\right\rvert}$.

    Suppose ${\mathcal{H}}$ is a Berge-$F$-free hypergraph on $n$ vertices. In this short note, we prove that as long as every edge of ${\mathcal{H}}$ has size at least the Ramsey number of $F$ and at most $o(n)$, the weight of ${\mathcal{H}}$ is $o(n^2)$. This result is best possible in some sense. Along the way, we study other weight functions, and strengthen results of Gerbner and Palmer; and Grósz, Methuku and Tompkins.
author:
- |
    Sean English [^1] Dániel Gerbner[^2] Abhishek Methuku[^3]\
    Cory Palmer[^4]
date:  
title: ' On the weight of Berge-$F$-free hypergraphs '
---

Introduction
============

Generalizing the notion of hypergraph cycles due to Berge, the authors Gerbner and Palmer [@Gerbner_Palmer] introduced so-called *Berge hypergraphs*. Given a graph $F$, we say that a hypergraph ${\mathcal{H}}$ is Berge-$F$ if there is a bijection $f:E(F)\rightarrow E({\mathcal{H}})$ such that for every $e\in E(F)$ we have $e\subseteq f(e)$. Equivalently, ${\mathcal{H}}$ is Berge-$F$ if we can embed a distinct graph edge into each hyperedge of ${\mathcal{H}}$ to obtain a copy of $F$. Note that for a fixed $F$ there are many different hypergraphs that are Berge-$F$, and a fixed hypergraph ${\mathcal{H}}$ can be Berge-$F$ for many different graphs $F$. We say that a hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is Berge-$F$. There are several results concerning the largest size of Berge-$F$-free hypergraphs, see e.g. [@anssal; @FuLa; @GMP; @gmv; @Gerbner_Palmer; @G_P2; @GMT; @Gyori_triangle; @Gyori_Lemons; @GyLe4; @GyLe; @GyKaLe; @Palmer]. For a short survey of extremal results for Berge hypergraphs see Subsection 5.2.2 in [@gp].

Most of these results deal with the uniform case, but some also examine non-uniform hypergraphs. Note that replacing a hyperedge with a larger hyperedge containing it never removes a copy of Berge-$F$, but may add a copy. Thus, to build a Berge-$F$-free hypergraph that maximizes the number of hyperedges, one picks small hyperedges. To make large hyperedges more attractive, one can assign a weight to each hyperedge that increases with the size of the hyperedge.

Győri [@Gyori_triangle] proved that if ${\mathcal{H}}$ is a Berge-triangle-free hypergraph, then $\sum_{h\in E({\mathcal{H}})}({\left\lvert{h}\right\rvert}-2)\le n^2/8$ if $n$ is large enough. Note that this result is about a multi-hypergraph ${\mathcal{H}}$, thus $\sum_{h\in E({\mathcal{H}})}{\left\lvert{h}\right\rvert}$ can be arbitrarily large by taking a hyperedge of size $2$ an arbitrary number of times. In [@GyLe4], the authors showed that for a Berge-$C_4$-free multi-hypergraph ${\mathcal{H}}$ we have $\sum_{h\in E({\mathcal{H}})}({\left\lvert{h}\right\rvert}-3)\le 12\sqrt{2}n^{3/2}+O(n)$ and they gave a construction of a Berge-$C_4$-free multi-hypergraph with approximately $n^{3/2}/8$ hyperedges. The upper bound was improved by Gerbner and Palmer [@Gerbner_Palmer] to $\sqrt{6}n^{3/2}/2$, while the lower bound was improved to $(1+o(1))n^{3/2}/({3\sqrt{3}})$. For arbitrary cycles, Győri and Lemons [@GyLe] proved that if ${\mathcal{H}}$ is either a Berge-$C_{2k}$-free or Berge-$C_{2k+1}$-free hypergraph on $n$ vertices and every hyperedge in ${\mathcal{H}}$ has size at least $4k^2$, then $\sum_{h\in E({\mathcal{H}})}{\left\lvert{h}\right\rvert}=O(n^{1+1/k})$.

Gerbner and Palmer [@Gerbner_Palmer] proved the following general result about Berge-$F$-free hypergraphs.

\[gp\_size\] Let $F$ be a graph and let ${\mathcal{H}}$ be a Berge-$F$-free hypergraph on $n$ vertices. If every hyperedge in ${\mathcal{H}}$ has size at least $|V(F)|$, then $\sum_{h \in E({\mathcal{H}})} {\left\lvert{h}\right\rvert} = O(n^2)$.

We strengthen Theorem \[gp\_size\] in Theorem \[higheruniformity\] by showing that the statement still holds if one replaces ${\left\lvert{h}\right\rvert}$ with ${\left\lvert{h}\right\rvert}^2$ in the above sum; moreover, our proof is much simpler compared to the proof of Gerbner and Palmer in [@Gerbner_Palmer]. For uniform hypergraphs, the above theorem states that for any graph $F$ and Berge-$F$-free $r$-uniform $n$-vertex hypergraph ${\mathcal{H}}$ we have ${\left\lvert{E({\mathcal{H}})}\right\rvert}=O(n^2)$ provided $r$ is large enough. Grósz, Methuku and Tompkins showed that, in fact, ${\left\lvert{E({\mathcal{H}})}\right\rvert}=o(n^2)$ for large enough $r$. This is stated more precisely in the following theorem. Given two graphs $F$ and $G$, let $R(F,G)$ denote the $2$-color Ramsey number of $F$ and $G$. If $e\in E(F)$, then we write $F\setminus e$ for the graph with $V(F\setminus e)=V(F)$ and $E(F\setminus e)=E(F)\setminus\{e\}$.

\[gmt\_threshold\] Let $F$ be a fixed graph and $e \in E(F)$. Let ${\mathcal{H}}$ be an $r$-uniform Berge-$F$-free hypergraph. If $r \ge R(F,F\setminus e)$, then ${\left\lvert{E({\mathcal{H}})}\right\rvert} = o(n^2)$.

We improve this theorem in Theorem \[loweruniformity\]. Let us return to non-uniform hypergraphs. So far, we have only added up the sizes of the hyperedges. Here we will change the weight function and consider first $\sum_{h \in E({\mathcal{H}})} {\left\lvert{h}\right\rvert}^2$.

\[higheruniformity\] Let $F$ be a fixed graph. Let ${\mathcal{H}}$ be a Berge-$F$-free hypergraph on $n$ vertices such that every edge of ${\mathcal{H}}$ has size at least ${\left\lvert{V(F)}\right\rvert}$. Then $$\sum_{h \in E({\mathcal{H}})} {\left\lvert{h}\right\rvert}^2 = O(n^2).$$

Furthermore, this result is trivially sharp as can be seen by considering any hypergraph with at least one edge of size $\Omega(n)$. Interestingly, the next theorem shows that either small or large edges are necessary for such a weighted sum to reach this upper bound.

\[loweruniformity\] Let $F$ be a fixed graph and let $e\in E(F)$. Let ${\mathcal{H}}$ be a Berge-$F$-free hypergraph on $n$ vertices such that every edge of ${\mathcal{H}}$ has size at least $R(F, F \setminus e)$ and at most $o(n)$. Then $$\sum_{h \in E({\mathcal{H}})} {\left\lvert{h}\right\rvert}^2 = o(n^2).$$

Combining Theorem \[higheruniformity\] and Theorem \[loweruniformity\], we can show the sum of the sizes of the edges (i.e., the weight) of a Berge-$F$-free hypergraph is $o(n^2)$ provided all the hyperedges are large enough, presenting another improvement of Theorem \[gp\_size\] and Theorem \[gmt\_threshold\]. In fact, this follows from a much more general theorem (which is presented below) by setting $w(m) = m$.

\[main\] Let $F$ be a fixed graph and let $e\in E(F)$. Let ${\mathcal{H}}$ be a Berge-$F$-free hypergraph on $n$ vertices such that every edge of ${\mathcal{H}}$ has size at least $R(F, F \setminus e)$. If $w:\mathbb{Z}_+\rightarrow \mathbb{Z}_+$ is any weight function such that $w(m)=o(m^2)$, then $$\sum_{h \in E({\mathcal{H}})} w({\left\lvert{h}\right\rvert}) = o(n^2).$$

Before we prove our results, we will comment on some of the specific conditions in Theorem \[main\].

Theorem \[main\] is best possible in the sense that one cannot take a larger weight function. Indeed if $w(m) = \Omega(m^2)$, then considering a single hyperedge of size $n$ shows that the conclusion of Theorem \[main\] cannot hold. More precisely, this gives a Berge-$F$-free hypergraph ${\mathcal{H}}$ with $\sum_{h\in {\mathcal{H}}} w(|h|) \ge w(n)$. On the other hand, for many weight functions with $w(m)=\Omega(m^2)$, the bound $O(w(n))$ is an upper bound on the weight of Berge-$F$-free hypergraphs: Indeed, if the function $\max_{1\leq i\leq n} w(i)/i^2=O\left( w(n)/n^2 \right)$ (which is achieved e.g. if $w(m)/m^2$ is eventually non-decreasing in $m$), then using Theorem \[higheruniformity\] we have $$\sum_{h \in E({\mathcal{H}})} w(|h|)=\sum_{h \in E({\mathcal{H}})} \frac{w(|h|)}{|h|^2}|h|^2 =O \left(\frac{w(n)}{n^2}\right)\sum_{h \in E({\mathcal{H}})} |h|^2=O(w(n)).$$

Note that in Theorem \[main\], the smallest possible size of edges allowed in ${\mathcal{H}}$ must grow with the forbidden graph $F$: Indeed, let $r$ be an integer and assume $r\mid n$. Let a vertex set on $n$ vertices be partitioned into $n/r$ singletons and $n/r$ sets of size $r-1$. Let ${\mathcal{H}}$ be the $r$-uniform hypergraph consisting of all the edges that contain one singleton and one $(r-1)$-set. Then it is easily verified that ${\mathcal{H}}$ is an $r$-uniform Berge-$K_r$-free hypergraph, but $\sum_{h\in E({\mathcal{H}})}|h|=n^2/r$. In fact, it was shown by Grósz, Methuku and Tompkins [@GMT] that there are $(\omega(F)-1)^2$-uniform Berge-$F$-free hypergraphs with $\Omega(n^2)$ edges, where $\omega(F)$ denotes the clique number of $F$. It is an interesting open problem to determine the smallest uniformity when $\Omega(n^2)$ drops to $o(n^2)$.

It is also worth noting that the bound $o(n^2)$ in Theorem \[main\] is close to being best possible: Erdős, Frankl and Rödl [@Erdos_Frankl_Rodl] constructed $r$-uniform hypergraphs with more than $n^{2-\varepsilon}$ hyperedges for any $\varepsilon$, and with the property that there are no 3 hyperedges on $3(r-1)$ vertices. Observe that a Berge-triangle is on at most $3(r-1)$ vertices, hence those hypergraphs are also Berge-triangle-free.

**Notation.** In the rest of the paper, we use the following notation. For a set $S$ of vertices, let $\Gamma(S)$ denote the graph whose edge-set is the set of all the pairs contained in $S$. For a hypergraph ${\mathcal{H}}$, its 2-shadow is the graph whose edge-set is $\Gamma({\mathcal{H}}) := \cup_{h \in {\mathcal{H}}} \Gamma(\{h\})$, i.e. all the edges contained in at least one hyperedge of ${\mathcal{H}}$.

Proofs
======

We will use the following lemma in our proofs.

\[ErdStoneSim\] Let $F$ be a non-empty graph. There exists a constant $\beta = \beta(F) > 0$ such that for any $n \ge |V(F)|$, the maximum number of edges in an $F$-free graph on $n$ vertices is at most $(1 - \beta) \binom{n}{2}$.

Let us fix a real number $\alpha$ such that $1>\alpha>\frac{1}{\chi(F)-1}$ if $\chi(F)\ge 3$ and $0<\alpha<1$ if $\chi(F)=2$. According to the Erdős-Stone-Simonovits theorem there exists an $n_0\ge |V(F)|$ such that any $F$-free graph on $n\ge n_0$ vertices contains at most $(1-\alpha)\binom{n}{2}$ edges. On the other hand, if $|V(F)| \le n < n_0$, then obviously an $F$-free graph contains at most $\binom{n}{2} - 1 \le \left(1 - \frac{1}{\binom{n_0}{2}}\right) \binom{n}{2}$ edges. Therefore, letting $\beta:=\min\left\{\alpha,\frac{1}{\binom{n_0}{2}}\right\}$ proves the lemma.

Proof of Theorem \[higheruniformity\]
-------------------------------------

We will say an edge in $\Gamma({\mathcal{H}})$ is *blue* if it is contained in at most ${\left\lvert{E(F)}\right\rvert}-1$ hyperedges of ${\mathcal{H}}$.

\[blueineveryF\] Every copy of $F$ in $\Gamma({\mathcal{H}})$ contains a blue edge.

Consider a copy of $F$ in $\Gamma({\mathcal{H}})$. If there is no blue edge in $F$ then every edge of $F$ is contained in at least ${\left\lvert{E(F)}\right\rvert}$ hyperedges of ${\mathcal{H}}$ by definition, so one can greedily choose different hyperedges representing the edges of $F$. Thus we have a Berge-$F$ in ${\mathcal{H}}$, a contradiction.

The following claim bounds the number of blue edges in a hyperedge of ${\mathcal{H}}$ from below.

\[manyblueedges\] Let $h \in E({\mathcal{H}})$ be a hyperedge. Then there exists a constant $\beta = \beta(F)>0$, such that the number of blue edges in $\Gamma(h)$ is at least $\beta\binom{{\left\lvert{h}\right\rvert}}{2}$.

The graph $\Gamma(h)$ is a clique on $|h|\geq |V(F)|$ vertices, and by Claim \[blueineveryF\], the set of blue edges in $\Gamma(h)$ form a graph, the complement of which is $F$-free. Thus, Lemma \[ErdStoneSim\] guarantees a constant $\beta=\beta(F)>0$ such that there are at least $\beta\binom{{\left\lvert{h}\right\rvert}}{2}$ blue edges in $\Gamma(h)$.

Using Claim \[manyblueedges\], we have

$$\label{equation sum h choose 2}
\sum_{h \in E({\mathcal{H}})}  \beta\binom{{\left\lvert{h}\right\rvert}}{2} \le \sum_{h \in E({\mathcal{H}})} \# \{\text{Blue edges in $\Gamma(h)$}\}.$$

On the other hand, we have $$\label{equation On^2}
\sum_{h \in E({\mathcal{H}})} \# \{\text{Blue edges in $\Gamma(h)$}\} \le \# \{\text{Blue edges in $\Gamma({\mathcal{H}})$}\} \cdot ({\left\lvert{E(F)}\right\rvert}-1) = O(n^2).$$

Indeed each blue edge is counted at most ${\left\lvert{E(F)}\right\rvert}-1$ times in the summation as it is contained in at most ${\left\lvert{E(F)}\right\rvert}-1$ hyperedges of ${\mathcal{H}}$. Then combining equations and , we have $\sum_{h \in E({\mathcal{H}})}  \beta\binom{{\left\lvert{h}\right\rvert}}{2}=O(n^2)$ for constant $\beta$, which implies that $\sum_{h \in E({\mathcal{H}})}  {\left\lvert{h}\right\rvert}^2 \le \sum_{h \in E({\mathcal{H}})} 4\binom{{\left\lvert{h}\right\rvert}}{2} =O(n^2)$, completing the proof.

Proof of Theorem \[loweruniformity\]
------------------------------------

If $F$ has one or fewer edges, the statement is trivial, so we will assume $F$ has at least two edges throughout the rest of the proof. Here we follow an argument similar to Grósz, Methuku and Tompkins [@GMT] but with some important changes. We wish to apply the graph removal lemma to the 2-shadow of a hypergraph ${\mathcal{H}}$. To this end, we prove the following claim.

\[numberbound\] The number of copies of $F$ in $\Gamma({\mathcal{H}})$ is $o(n^{{\left\lvert{V(F)}\right\rvert}})$.

Any copy of $F$ in $\Gamma({\mathcal{H}})$ has at least two edges (and therefore at least three vertices) in some hyperedge of ${\mathcal{H}}$, otherwise the hyperedges containing the edges of $F$ would form a Berge-$F$. Thus we have the following upper bound: $$\# \{\text{$F$-copies in $\Gamma({\mathcal{H}})$}\} \le \sum_{h \in {\mathcal{H}}} \binom{|h|}{3} n^{{\left\lvert{V(F)}\right\rvert}-3} \binom{\binom{{\left\lvert{V(F)}\right\rvert}}{2}}{{\left\lvert{E(F)}\right\rvert}}\le n^{{\left\lvert{V(F)}\right\rvert}-3}\binom{\binom{{\left\lvert{V(F)}\right\rvert}}{2}}{{\left\lvert{E(F)}\right\rvert}}\sum_{h \in {\mathcal{H}}} |h|^3.$$ Indeed, there are $\binom{|h|}{3}$ ways to select three vertices from a hyperedge $h \in {\mathcal{H}}$ and there are at most $n^{{\left\lvert{V(F)}\right\rvert}-3}$ ways to select the remaining ${\left\lvert{V(F)}\right\rvert}-3$ vertices to form a set of ${\left\lvert{V(F)}\right\rvert}$ vertices. The number of copies of $F$ in this set is bounded by $\binom{\binom{{\left\lvert{V(F)}\right\rvert}}{2}}{{\left\lvert{E(F)}\right\rvert}}$.

By our assumption, $|h| = o(n)$, and by Theorem \[higheruniformity\], we have $\sum_{h \in {\mathcal{H}}} {\left\lvert{h}\right\rvert}^2=O(n^2)$, so $\sum_{h \in {\mathcal{H}}} |h|^3 = \sum_{h \in {\mathcal{H}}} |h| \cdot |h|^2 = o(n) \sum_{h \in {\mathcal{H}}} |h|^2 = o(n^3)$. Therefore, the number of copies of $F$ in $\Gamma({\mathcal{H}})$ is $o(n^{{\left\lvert{V(F)}\right\rvert}})$, proving the claim.

By Claim \[numberbound\] and the graph removal lemma, there is a set ${\mathcal{R}}$ of $o(n^2)$ edges in $\Gamma({\mathcal{H}})$ such that every copy of $F$ in the 2-shadow of ${\mathcal{H}}$ contains an edge of ${\mathcal{R}}$. We will call an edge in the 2-shadow of ${\mathcal{H}}$ *special* if it is contained in ${\mathcal{R}}$ and is contained in at most ${\left\lvert{E(F)}\right\rvert}-1$ hyperedges. Note that the special edges here play a similar but slightly different role than the blue edges in the proof of Theorem \[higheruniformity\]. Let ${\mathcal{R}}_s$ be the set of all the special edges. Of course, ${\mathcal{R}}_s \subseteq {\mathcal{R}}$.

Recall that $e\in E(F)$, and $R(F,F\setminus e)$ denotes the Ramsey number of $F$ versus $F \setminus e$.

\[counting\] \[findingonespecialedge\] Let $h \in E({\mathcal{H}})$ be an arbitrary hyperedge. Then any subset $S \subseteq h$ of size $R(F,F\setminus e)$ contains a special edge (i.e., $\Gamma(S) \cap {\mathcal{R}}_s \not = \emptyset$).

Assume by contradiction that there is a set $S \subseteq h$ of size $R(F, F \setminus e)$ which contains no special edge. In other words, every edge of ${\mathcal{R}}$ contained in $S$ is in at least ${\left\lvert{E(F)}\right\rvert}$ hyperedges. By the definition of ${\mathcal{R}}$, $\Gamma(S)\setminus {\mathcal{R}}$ cannot contain a copy of $F$. Applying Ramsey’s theorem with the edges of $\Gamma(S)\setminus {\mathcal{R}}$ colored with the first color and those in $\Gamma(S)\cap{\mathcal{R}}$ colored with the second, we obtain that $\Gamma(S)\cap{\mathcal{R}}$ must contain a copy of $F\setminus e$. Let $\hat e$ be an edge contained in $S$ whose addition would complete this copy of $F$. The other edges of this copy of $F$ are each contained in at least ${\left\lvert{E(F)}\right\rvert}$ hyperedges of ${\mathcal{H}}$. Thus we can select greedily ${\left\lvert{E(F)}\right\rvert}$ different hyperedges of ${\mathcal{H}}$ to represent the edges in this copy of $F$: $h$ itself for $\hat e$, and ${\left\lvert{E(F)}\right\rvert}-1$ other hyperedges for the rest of the edges of $F$. These hyperedges form a Berge-$F$ in ${\mathcal{H}}$, a contradiction.

Now we provide a lower bound on the number of special edges contained in a hyperedge of ${\mathcal{H}}$.

\[findingmanyspecialedges\] Let $h \in {\mathcal{H}}$ be a hyperedge. Then there is a constant $\gamma = \gamma(F)$ such that $${\left\lvert{\Gamma(h) \cap {\mathcal{R}}_s}\right\rvert} \ge \gamma\binom{{\left\lvert{h}\right\rvert}}{2}.$$

Claim \[findingonespecialedge\] implies that $\Gamma(h) \setminus {\mathcal{R}}_s$ does not contain a complete graph on $R(F, F \setminus e)$ vertices. So by Lemma \[ErdStoneSim\], $\Gamma(h) \setminus {\mathcal{R}}_s$ contains at most $(1-\gamma) \binom{{\left\lvert{h}\right\rvert}}{2}$ edges for some constant $\gamma = \gamma(F)$. So $\Gamma(h) \cap {\mathcal{R}}_s$ contains at least $\gamma\binom{{\left\lvert{h}\right\rvert}}{2}$ edges, as desired.

Now since ${\mathcal{R}}_s \subseteq {\mathcal{R}}$, we have ${\left\lvert{{\mathcal{R}}_s}\right\rvert} = o(n^2)$. This fact together with Claim \[findingmanyspecialedges\] implies the following.

$$\sum_{h \in {\mathcal{H}}} \gamma\binom{{\left\lvert{h}\right\rvert}}{2} \le \sum_{h \in {\mathcal{H}}} {\left\lvert{\Gamma(h) \cap {\mathcal{R}}_s}\right\rvert} \le {\left\lvert{{\mathcal{R}}_s}\right\rvert} ({\left\lvert{E(F)}\right\rvert}-1) = o(n^2).$$

Indeed, the sum $\sum_{h \in {\mathcal{H}}} {\left\lvert{\Gamma(\{h\}) \cap {\mathcal{R}}_s}\right\rvert}$ counts each edge of ${\mathcal{R}}_s$ at most ${\left\lvert{E(F)}\right\rvert}-1$ times.

Proof of Theorem \[main\]
-------------------------

Since $w(m) = o(m^2)$ and $w$ is defined only on $\mathbb{Z}_+$, there are only finitely many values of $m$ such that $w(m)>m^2$, and thus $w(m)=O(m^2)$. Let $C$ be a constant such that $w(m) \le C m^2$ for all $m\in\mathbb{Z}_+$. Theorem \[loweruniformity\] implies that

$$\label{eq:eq1}
\sum_{h \in E({\mathcal{H}}): |h| \le n^{1/2}} w(|h|) \le \sum_{h \in E({\mathcal{H}}): |h| \le n^{1/2}} C |h|^2  = o(n^2),$$

simply because $n^{1/2} = o(n)$. Now since $w(m) = o(m^2)$, Theorem \[higheruniformity\] implies that $$\label{eq:eq2}
\sum_{h \in E({\mathcal{H}}): |h| > n^{1/2}} w(|h|)  = \sum_{h \in E({\mathcal{H}}): |h| > n^{1/2}} o(|h|^2) = o\left(\sum_{h \in E({\mathcal{H}}): |h| > n^{1/2}} |h|^2\right) = o(n^2).$$

So adding up and , the proof is complete.

Acknowledgements {#acknowledgements .unnumbered}
----------------

We thank József Balogh for suggesting the line of investigation carried out in this paper.

The research of Gerbner was supported by the János Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the National Research, Development and Innovation Office – NKFIH, grant SNN 116095, grant K 116769 and grant KH 130371.

The research of Methuku was partially supported by the National Research, Development and Innovation Office NKFIH grant K116769.

The research of Palmer was partially supported by University of Montana UGP Grant \#M25460.

[99]{}

R. Anstee and S. Salazar. Forbidden Berge hypergraphs. Electronic Journal of Combinatorics, 24(1), 2017. P1.59.

P. Erdős, P. Frankl and V. Rödl. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs and Combinatorics 2(1), 113–121, (1986). doi:10.1007/BF01788085

Z. Füredi and L. Özkahya. On 3-uniform hypergraphs without a cycle of a given length. Discrete Applied Mathematics, 216, 582–588, (2017).

D. Gerbner, A. Methuku and C. Palmer. General lemmas for Berge-Turán hypergraph problems, arXiv preprint arXiv:1808.10842 (2018).

D. Gerbner, A. Methuku and M. Vizer. Asymptotics for the Turán number of Berge-$K_{2,t}$, Journal of Combinatorial Theory, Series B, to appear

D. Gerbner and C. Palmer. Extremal results for Berge-hypergraphs. SIAM Journal on Discrete Mathematics, 31(4): 2314–2327 (2015). doi:10.1137/16M1066191

D. Gerbner and C. Palmer. Counting copies of a fixed subgraph in $ F $-free graphs. [*arXiv preprint*]{} arXiv:1805.07520 (2018).

D. Gerbner and B. Patkós. Extremal Finite Set Theory, 1st Edition, CRC Press, 2018.

D. Grósz, A. Methuku and C. Tompkins. Uniformity thresholds for the asymptotic size of extremal Berge-$F$-free hypergraphs. arXiv preprint arXiv:1803.01953 (2018).

E. Győri. Triangle-Free Hypergraphs. Combinatorics, Probability and Computing, 15 (1-2): 185–191 (2006). doi:10.1017/S0963548305007108

E. Győri, G.Y. Katona and N. Lemons. Hypergraph extensions of the [E]{}rd[ő]{}s-[G]{}allai theorem. Electronic Notes in Discrete Mathematics, 36: 655–662 (2010).

E. Győri and N. Lemons. 3-uniform hypergraphs avoiding a given odd cycle. Combinatorica, 32: 187–203 (2012). doi:10.1007/s00493-012-2584-4

E. Győri and N. Lemons. Hypergraphs with no cycle of length 4, Discrete Math., 312 (2012), 541 pp. 1518–1520.

E. Győri and N. Lemons. Hypergraphs with no cycle of a given length. Combin. Probab. Comput., 21(1-2):193–201, 2012.

C. Palmer, M. Tait, C. Timmons and A.Z. Wagner. Turán numbers for Berge-hypergraphs and related extremal problems. arXiv preprint arXiv:1706.04249 (2017).

[^1]: Ryerson University, Toronto, Canada. E-mail: `sean.english@ryerson.ca`

[^2]: Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. E-mail: `gerbner@renyi.hu`

[^3]: École Polytechnique Fédérale de Lausanne, Switzerland. E-mail: `abhishekmethuku@gmail.com`

[^4]: University of Montana, Missoula, Montana 59812, USA. E-mail: `cory.palmer@umontana.edu`
