On a problem concerning separating systems of a finite set

DOI10.1016/S0021-9800(69)80011-6zbMath0208.02403OpenAlexW2076191827MaRDI QIDQ5608784

T. J. Dickson

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80011-6

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (19)

Geometric systems of unbiased representatives ⋮ On the path separation number of graphs ⋮ Separating systems and oriented graphs of diameter two ⋮ On separating systems ⋮ Completely separating systems of \(k\)-sets ⋮ 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 separating systems of graphs ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ On Antimagic Labeling for Generalized Web and Flower Graphs ⋮ Induced-bisecting families of bicolorings for hypergraphs ⋮ Smart elements in combinatorial group testing problems ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Minimal completely separating systems of \(k\)-sets ⋮ A generalization of completely separating systems ⋮ Combinatorial configurations in the definition of antimagic labelings of graphs ⋮ Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum

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