4 citations · 22 across the 36 of their papers we have counts for
4 papers · 1 filter
On forbidding graphs as traces of hypergraphs
Dániel Gerbner, Michael E. Picollelli
We say that a hypergraph contains a graph as a trace if there exists some set such that $\mathcal{H}|_S=\{h\cap S: h\in E(\mathcal{H})\}…
On generalized Turán problems with bounded matching number
Dániel Gerbner
Given a graph and a family of graphs , the generalized Turán number is the maximum number of copies of in an -vertex graphs t…
Query complexity of Boolean functions on the middle slice of the cube
Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy +4
We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query all but 7 input bits to co…
On non-degenerate Turán problems for expansions
Dániel Gerbner
The -uniform expansion of a graph is obtained by enlarging each edge with new vertices such that altogether we use new vertices. Two simple lo…