Tur\'an numbers of Berge trees

DOI10.1016/J.DISC.2022.113286arXiv1904.06728MaRDI QIDQ6317166FDOQ6317166

Authors: Ervin Győri, Nika Salia, Casey Tompkins, Oscar Zamora 

Publication date: 14 April 2019

Abstract: A classical conjecture of ErdH{o}s and S'os asks to determine the Tur'an number of a tree. We consider variants of this problem in the settings of hypergraphs and multi-hypergraphs. In particular, for all $k$ and $r$, with $rgek(k-2)$, we show that any $r$-uniform hypergraph $mathcalH$ with more than $fracn(k-1)r+1$ hyperedges contains a Berge copy of any tree with $k$ edges different from the $k$-edge star. This bound is sharp when $r+1$ divides $n$ and for such values of $n$ we determine the extremal hypergraphs.

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Hypergraphs (05C65)

This page was built for publication: Tur\'an numbers of Berge trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317166)