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})} |h|$. 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$, 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.
@article{10_37236_8504,
author = {Sean English and D\'aniel Gerbner and Abhishek Methuku and Cory Palmer},
title = {On the weight of {Berge-\(F\)-free} hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {4},
doi = {10.37236/8504},
zbl = {1422.05073},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8504/}
}
TY - JOUR
AU - Sean English
AU - Dániel Gerbner
AU - Abhishek Methuku
AU - Cory Palmer
TI - On the weight of Berge-\(F\)-free hypergraphs
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/8504/
DO - 10.37236/8504
ID - 10_37236_8504
ER -
%0 Journal Article
%A Sean English
%A Dániel Gerbner
%A Abhishek Methuku
%A Cory Palmer
%T On the weight of Berge-\(F\)-free hypergraphs
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/8504/
%R 10.37236/8504
%F 10_37236_8504
Sean English; Dániel Gerbner; Abhishek Methuku; Cory Palmer. On the weight of Berge-\(F\)-free hypergraphs. The electronic journal of combinatorics, Tome 26 (2019) no. 4. doi: 10.37236/8504
