74 citations · 102 across the 28 of their papers we have counts for
4 papers · 2 filters
Generalized rainbow Turán problems
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku +1
Alon and Shikhelman initiated the systematic study of the following generalized Turán problem: for fixed graphs and and an integer , what is the maximum number of copies…
On supersaturation and stability for generalized Turán problems
Anastasia Halfpap, Cory Palmer
Fix graphs and . Let denote the maximum number of copies of a graph in an -vertex -free graph. In this note we will give a new general supersa…
Hypergraph based Berge hypergraphs
Martin Balko, Daniel Gerbner, Dong Yeap Kang +2
Fix a hypergraph . A hypergraph is called a {\it Berge copy of } or {\it Berge-} if we can choose a subset of each hyperedge of…
On the weight of Berge--free hypergraphs
Sean English, Dániel Gerbner, Abhishek Methuku +1
For a graph , we say a hypergraph is a Berge- if it can be obtained from by replacing each edge of with a hyperedge containing it. A hypergraph is Berge--free if i…