4 citations · 22 across the 30 of their papers we have counts for
7 papers · 1 filter
A note on the uniformity threshold for Berge hypergraphs
Dániel Gerbner
A Berge copy of a graph is a hypergraph obtained by enlarging the edges arbitrarily. Grósz, Methuku and Tompkins in 2020 showed that for any graph , there is an integer $r_0=r_0…
A non-aligning variant of generalized Turán problems
Dániel Gerbner
In the so-called generalized Turán problems we study the largest number of copies of in an -vertex -free graph . Here we introduce a variant, where is not forbidde…
Generalized Turán problems for
Dániel Gerbner
We study the generalized Turán function , when or is . We determine the order of magnitude of when is a tree, and determine its as…
On saturation of Berge hypergraphs
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
A hypergraph is a Berge copy of a graph , if and there is a bijection such that for any we have $e\subse…
Forbidden subposet problems in the grid
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +1
For posets and , extremal and saturation problems about weak and strong -free subposets of have been studied mostly in the case is the Boolean poset , the po…
A note on stability for maximal -free graphs
Dániel Gerbner
Popielarz, Sahasrabudhe and Snyder in 2018 proved that maximal -free graphs with edges contain a complete -partite s…