On separating systems of a finite set

Cited In (42)

Collections of Subsets with the Sperner Property
Inclusionwise minimal completely separating systems
Optimality aspects of row-column designs with non-orthogonal structure
Compressions and probably intersecting families
Minimum average-case queries of \(q+1\)-ary search game with small sets
On face numbers of manifolds with symmetry
Separating path systems of almost linear size
Partition dimension of projective planes
On separating systems whose elements are sets of at most k elements
Search with small sets in presence of a liar
Separating systems and oriented graphs of diameter two
Induced-bisecting families of bicolorings for hypergraphs
Geometric systems of unbiased representatives
Nonadaptive group testing with lies: probabilistic existence theorems
Identifying codes and searching with balls in graphs
Bisecting and \(D\)-secting families for set systems
A generalization of completely separating systems
System of unbiased representatives for a collection of bicolorings
A combinatorial search problem on matroids
Search problems in vector spaces
Minimal completely separating systems of \(k\)-sets
Revisiting sequential search using question-sets with bounded intersections
Sequential search using question-sets with bounded intersections
Completely separating systems of \(k\)-sets
Existence theorems for some group testing strategies
Transference for the Erdős-Ko-Rado theorem
The edge-coloring of complete hypergraphs. I
On separating systems
A product version of the Hilton-Milner theorem
Minimum number of queries for an adaptive liar search game with small sets
On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem
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
Density-based group testing
Disjoint spread systems and fault location
Covering complete hypergraphs with cuts of minimum total size
Bipartite Hansel results for hypergraphs
Ratewise-optimal non-sequential search strategies under constraints on the tests
On the Rényi-Ulam game with restricted size queries
Optimal superimposed codes and designs for Renyi's search model
On two random search problems

This page was built for publication: On separating systems of a finite set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5519908)