74 citations · 102 across the 28 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015★ 1 cited
Generalising separating families of fixed size
Fabrício S. Benevides, Dániel Gerbner, Cory T. Palmer +1
We examine the following version of a classic combinatorial search problem introduced by Rényi: Given a finite set of elements we want to identify an unknown subset $Y \sub…
math.CO2015★ 4 cited
Extremal results for Berge-hypergraphs
Dániel Gerbner, Cory Palmer
Let be a graph and be a hypergraph both on the same vertex set. We say that a hypergraph is a \emph{Berge}- if there is a bijection $f : E(G) \ri…