Inclusionwise minimal completely separating systems
From MaRDI portal
Publication:2431691
Recommendations
Cites work
- Another algebraic proof of Bondy's theorem on induced subsets
- Completely separating systems of \(k\)-sets
- Induced subsets
- Minimal completely separating systems
- Minimal completely separating systems of \(k\)-sets
- On a problem concerning separating systems of a finite set
- On separating systems of a finite set
- On separating systems whose elements are sets of at most k elements
- Unavoidable traces of set systems
Cited in
(5)- scientific article; zbMATH DE number 2230919 (Why is no real title available?)
- Completely separating systems of \(k\)-sets for \(\binom{k-1}{2}\leq n<\binom{k}{2}\) or \(11\leq k\leq 12\)
- Generalized set dominating and separating systems
- On the number of minimal completely separating systems and antichains in a Boolean lattice
- scientific article; zbMATH DE number 841642 (Why is no real title available?)
This page was built for publication: Inclusionwise minimal completely separating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431691)