Minimal completely separating systems
From MaRDI portal
Publication:5577111
DOI10.1016/S0021-9800(70)80038-2zbMath0185.03201MaRDI QIDQ5577111
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (23)
Geometric systems of unbiased representatives ⋮ Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ Separating systems and oriented graphs of diameter two ⋮ On separating systems ⋮ Rounds in combinatorial search ⋮ Completely separating systems of \(k\)-sets ⋮ Tree-chromatic number ⋮ Bipartite Hansel results for hypergraphs ⋮ Inclusionwise minimal completely separating systems ⋮ System of unbiased representatives for a collection of bicolorings ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ On a problem of Katona on minimal completely separating systems with restrictions ⋮ On separating systems of graphs ⋮ Strict group testing and the set basis problem ⋮ Induced-bisecting families of bicolorings for hypergraphs ⋮ On biclique coverings ⋮ Smart elements in combinatorial group testing problems ⋮ Some new bounds for cover-free families through biclique covers ⋮ Minimal completely separating systems of \(k\)-sets ⋮ On a problem of Katona on minimal separating systems ⋮ A generalization of completely separating systems ⋮ On separating systems with bounded set size ⋮ Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum
This page was built for publication: Minimal completely separating systems
