On separating systems whose elements are sets of at most k elements

DOI10.1016/0012-365X(79)90101-8zbMath0416.05003MaRDI QIDQ754202

Ingo Wegener

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

subsetsseparating system

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (21)

A nonadaptive version of Ulam's problem with one lie ⋮ Separating systems and oriented graphs of diameter two ⋮ On separating systems ⋮ Completely separating systems of \(k\)-sets ⋮ Identifying defective sets using queries of small size ⋮ Bisecting and \(D\)-secting families for set systems ⋮ Probabilistic existence theorems in group testing ⋮ Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Bipartite Hansel results for hypergraphs ⋮ Inclusionwise minimal completely separating systems ⋮ System of unbiased representatives for a collection of bicolorings ⋮ Ratewise-optimal non-sequential search strategies under constraints on the tests ⋮ Induced-bisecting families of bicolorings for hypergraphs ⋮ Density-Based Group Testing ⋮ Minimal completely separating systems of \(k\)-sets ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ A combinatorial search problem on matroids ⋮ Search with small sets in presence of a liar ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Existence theorems for some group testing strategies ⋮ On separating systems with bounded set size

Cites Work

• On separating systems of a finite set

This page was built for publication: On separating systems whose elements are sets of at most k elements