On separating systems of a finite set
From MaRDI portal
Publication:5519908
DOI10.1016/S0021-9800(66)80024-8zbMath0144.00501OpenAlexW2070360430MaRDI QIDQ5519908
Publication date: 1966
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(66)80024-8
Related Items
Compressions and Probably Intersecting Families, Geometric systems of unbiased representatives, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, A nonadaptive version of Ulam's problem with one lie, Separating systems and oriented graphs of diameter two, Partition dimension of projective planes, 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, On the Rényi-Ulam game with restricted size queries, Minimum average-case queries of \(q+1\)-ary search game with small sets, A product version of the Hilton-Milner theorem, Bipartite Hansel results for hypergraphs, Inclusionwise minimal completely separating systems, System of unbiased representatives for a collection of bicolorings, Collections of Subsets with the Sperner Property, Sequential search using question-sets with bounded intersections, Covering complete hypergraphs with cuts of minimum total size, Search problems in vector spaces, Ratewise-optimal non-sequential search strategies under constraints on the tests, Induced-bisecting families of bicolorings for hypergraphs, Density-Based Group Testing, Optimality aspects of row-column designs with non-orthogonal structure, Minimal completely separating systems of \(k\)-sets, On face numbers of manifolds with symmetry, A generalization of completely separating systems, Nonadaptive group testing with lies: probabilistic existence theorems, Optimal superimposed codes and designs for Renyi's search model, A combinatorial search problem on matroids, Search with small sets in presence of a liar, Revisiting sequential search using question-sets with bounded intersections, Minimum number of queries for an adaptive liar search game with small sets, The edge-coloring of complete hypergraphs. I, On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem, On separating systems whose elements are sets of at most k elements, Existence theorems for some group testing strategies, On separating systems with bounded set size, Disjoint Spread Systems and Fault Location, On two random search problems, Identifying codes and searching with balls in graphs
