On the maximum number of qualitative independent partitions
From MaRDI portal
Publication:1121889
DOI10.1016/0097-3165(89)90081-2zbMath0675.05005OpenAlexW1970233409MaRDI QIDQ1121889
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(89)90081-2
Related Items
Sperner capacities, Capacities: From information theory to extremal set theory, On quorum systems for group resources allocation, On the extremal combinatorics of the Hamming space, Intersection number and capacities of graphs, Set systems related to a house allocation problem, Locating and detecting arrays for interaction faults, Strong qualitative independence., Upper bounds for covering arrays by tabu search., Multiplicity-free permutation representations of the symmetric group., A Sperner-type theorem and qualitative independence, Rényi 100, quantitative and qualitative (in)dependence, Unnamed Item, How to guess two letters correctly, \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays, Qualitative independence and Sperner problems for directed graphs, Delta-systems and qualitative (in)dependence, Graph-intersecting set systems and LYM inequalities, Optimal and near-optimal mixed covering arrays by column expansion, On the capacity of Boolean graph formulæ, Merging covering arrays and compressing multiple sequence alignments, On the state of strength-three covering arrays
Cites Work
- Unnamed Item
- Unnamed Item
- On qualitatively independent partitions and related problems
- Explicit construction of exponential sized families of k-independent sets
- An explicit construction of short monotone formulae for the monotone symmetric functions
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Orthogonal partitions and covering of graphs
- On generalized graphs
