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 $X$ of $n$ elements we want to identify an unknown subset $Y \sub…