Let n and k be fixed positive integers. A collection C of k-sets of [n] is a completely separating system if, for all distinct i, j # [n], there is an S # C for which i # S and j Γ S. Let R(n, k) denote the minimum size of such a C. Our results include showing that if n k is a sequence with k< 0, th
β¦ LIBER β¦
Minimal separating sets of maximum size
β Scribed by Y Alavi; M Behzad; E.A Nordhaus
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 325 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Minimal Completely Separating Systems of
β
AndrΓ© KΓΌndgen; Dhruv Mubayi; Prasad Tetali
π
Article
π
2001
π
Elsevier Science
π
English
β 117 KB
Maximum capacity with minimal size
π
Article
π
1998
π
Elsevier Science
π
English
β 118 KB
Minimal separating sets for acceptance c
β
Helmut Lescow; Jens VΓΆge
π
Article
π
2000
π
Elsevier Science
π
English
β 115 KB
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not. The set I of the inΓΏnitely often visited states can be replaced by the intersection I β© W with a ΓΏxed set W of states, provided W is large enough to distinguish between accepting and non-accepti
Maximum-sized antichains in minimal pose
β
K. M. Koh
π
Article
π
1985
π
Springer
π
English
β 459 KB
A characterization of separating disting
β
Jacqueline Shalhevet
π
Article
π
1972
π
Elsevier Science
π
English
β 541 KB
Finding all minimum-size separating vert
β
Arkady Kanevsky
π
Article
π
1993
π
John Wiley and Sons
π
English
β 812 KB