Minimal completely separating systems
From MaRDI portal
Cited in
(26)- On a problem of Katona on minimal completely separating systems with restrictions
- On separating systems of graphs
- On a problem of Katona on minimal separating systems
- Completely separating systems of k-sets
- Induced-bisecting families of bicolorings for hypergraphs
- Smart elements in combinatorial group testing problems
- Some new bounds for cover-free families through biclique covers
- Geometric systems of unbiased representatives
- Bipartite Hansel results for hypergraphs
- System of unbiased representatives for a collection of bicolorings
- On separating systems with bounded set size
- Inclusionwise minimal completely separating systems
- Strict group testing and the set basis problem
- On biclique coverings
- Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum
- Randomized group testing both query-optimal and minimal adaptive
- Rounds in combinatorial search
- Smart elements in combinatorial group testing problems with more defectives
- Minimal completely separating systems of \(k\)-sets
- Separating path systems of almost linear size
- Separating the edges of a graph by cycles and by subdivisions of K₄
- Cooperation in combinatorial search
- A generalization of completely separating systems
- Separating systems and oriented graphs of diameter two
- On separating systems
- Tree-chromatic number
This page was built for publication: Minimal completely separating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5577111)
