On separating systems of a finite set

Cited in

(45)

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

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)