4 citations · 22 across the 38 of their papers we have counts for
10 papers · 2 filters
Finding non-minority balls with majority and plurality queries
Huilan Chang, Dániel Gerbner, Balázs Patkós
Given a set of colored balls, a \textit{majority, non-minority or plurality ball} is one whose color class has size more than , at least or larger than any other col…
On the maximum number of copies of H in graphs with given size and order
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +1
We study the maximum number of copies of a graph in graphs with given number of vertices and edges. We show that for any fixed graph , is asymptotica…
On Clique Coverings of Complete Multipartite Graphs
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku +1
A clique covering of a graph is a set of cliques of such that any edge of is contained in one of these cliques, and the weight of a clique covering is the sum of the si…
Rainbow Ramsey problems for the Boolean lattice
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4
We address the following rainbow Ramsey problem: For posets what is the smallest number such that any coloring of the elements of the Boolean lattice either admits…
General lemmas for Berge-Turán hypergraph problems
Dániel Gerbner, Abhishek Methuku, Cory Palmer
For a graph , a hypergraph is a Berge copy of (or a Berge- in short), if there is a bijection such that for each $e \i…
Linearity of Saturation for Berge Hypergraphs
Sean English, Dániel Gerbner, Abhishek Methuku +1
For a graph , we say a hypergraph is Berge- if it can be obtained from be replacing each edge of with a hyperedge containing it. We say a hypergraph is Berge--…