4 citations · 22 across the 30 of their papers we have counts for
10 papers · 1 filter
Some exact results for regular Turán problems
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
As a variant of the famous Turán problem, we study , the maximum number of edges that an -vertex regular graph can have without containing a copy of . We d…
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…
Singular Turán numbers and WORM-colorings
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
A subgraph of is \textit{singular} if the vertices of either have the same degree in or have pairwise distinct degrees in . The largest number of edges of a grap…
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…
Hypergraphs without exponents
Zoltán Füredi, Dániel Gerbner
Here we give a short, concise proof for the following result. There exists a -uniform hypergraph (for ) without exponent, i.e., when the Turán function is not polyn…
On Berge-Ramsey problems
Dániel Gerbner
Given a graph , a hypergraph is a Berge copy of if and there is a bijection such that for any e…