On a problem concerning separating systems of a finite set

DOI10.1016/S0021-9800(69)80011-6zbMath0208.02403MaRDI 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

05A05: Permutations, words, matrices

Related Items

Smart elements in combinatorial group testing problems with more defectives, Minimal completely separating systems of \(k\)-sets, On the path separation number of graphs, Construction of antimagic labeling for the Cartesian product of regular graphs, A generalization of completely separating systems, Separating systems and oriented graphs of diameter two, On separating systems, On separating systems of graphs, Completely separating systems of \(k\)-sets, Induced-bisecting families of bicolorings for hypergraphs, Smart elements in combinatorial group testing problems, Combinatorial configurations in the definition of antimagic labelings of graphs, Geometric systems of unbiased representatives, Bipartite Hansel results for hypergraphs, System of unbiased representatives for a collection of bicolorings, Inclusionwise minimal completely separating systems, Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum, On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs, On Antimagic Labeling for Generalized Web and Flower Graphs