On separating systems whose elements are sets of at most k elements
From MaRDI portal
Publication:754202
DOI10.1016/0012-365X(79)90101-8zbMATH Open0416.05003MaRDI QIDQ754202FDOQ754202
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
Cited In (22)
- Inclusionwise minimal completely separating systems
- Probabilistic existence theorems in group testing
- Minimum average-case queries of \(q+1\)-ary search game with small sets
- Separating path systems of almost linear size
- Search with small sets in presence of a liar
- Separating systems and oriented graphs of diameter two
- Induced-bisecting families of bicolorings for hypergraphs
- Bisecting and \(D\)-secting families for set systems
- System of unbiased representatives for a collection of bicolorings
- A combinatorial search problem on matroids
- Minimal completely separating systems of \(k\)-sets
- Completely separating systems of \(k\)-sets
- Existence theorems for some group testing strategies
- Density-Based Group Testing
- On separating systems
- Minimal average cost of searching for a counterfeit coin: restricted model
- Minimum number of queries for an adaptive liar search game with small sets
- Identifying defective sets using queries of small size
- A nonadaptive version of Ulam's problem with one lie
- On separating systems with bounded set size
- Bipartite Hansel results for hypergraphs
- Ratewise-optimal non-sequential search strategies under constraints on the tests
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)
