On separating systems whose elements are sets of at most k elements
From MaRDI portal
Cites work
Cited in
(22)- Inclusionwise minimal completely separating systems
- Completely separating systems of \(k\)-sets
- Search with small sets in presence of a liar
- Ratewise-optimal non-sequential search strategies under constraints on the tests
- Bipartite Hansel results for hypergraphs
- Minimal average cost of searching for a counterfeit coin: restricted model
- Minimum average-case queries of \(q+1\)-ary search game with small sets
- Separating path systems of almost linear size
- A nonadaptive version of Ulam's problem with one lie
- Bisecting and \(D\)-secting families for set systems
- On separating systems with bounded set size
- Separating systems and oriented graphs of diameter two
- Existence theorems for some group testing strategies
- On separating systems
- Density-based group testing
- Induced-bisecting families of bicolorings for hypergraphs
- System of unbiased representatives for a collection of bicolorings
- Minimum number of queries for an adaptive liar search game with small sets
- Probabilistic existence theorems in group testing
- A combinatorial search problem on matroids
- Identifying defective sets using queries of small size
- Minimal completely separating systems of \(k\)-sets
This page was built for publication: On separating systems whose elements are sets of at most k elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754202)
