74 citations · 178 across the 85 of their papers we have counts for
4 papers · 1 filter
Rounds in a combinatorial search problem
Dániel Gerbner, Máté Vizer
We consider the following combinatorial search problem: we are given some excellent elements of and we should find at least one, asking questions of the following type: "Is t…
On the number of cycles in a graph with restricted cycle lengths
Dániel Gerbner, Balázs Keszegh, Cory Palmer +1
Let be a set of positive integers. We call a (directed) graph an \emph{-cycle graph} if all cycle lengths in belong to . Let be the maximum number of cyc…
Majority problems of large query size
Dániel Gerbner, Máté Vizer
We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-call…
Line Percolation in Finite Projective Planes
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros +2
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolatin…