Pages that link to "Item:Q1051639"
From MaRDI portal
The following pages link to On qualitatively independent partitions and related problems (Q1051639):
Displayed 22 items.
- Multiplicity-free permutation representations of the symmetric group. (Q659813) (← links)
- Constructions of new orthogonal arrays and covering arrays of strength three (Q965209) (← links)
- Covering arrays of strength 3 and 4 from holey difference matrices (Q1009124) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Explicit construction of exponential sized families of k-independent sets (Q1073031) (← links)
- On the maximum number of qualitative independent partitions (Q1121889) (← links)
- How to guess two letters correctly (Q1194746) (← links)
- Strong qualitative independence. (Q1422407) (← links)
- Upper bounds for covering arrays by tabu search. (Q1428561) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Intersection number and capacities of graphs (Q1896353) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- Sperner capacities (Q2366215) (← links)
- On quorum systems for group resources allocation (Q2377138) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- (Q4242741) (← links)
- Note on strong product graph dimension (Q5888906) (← links)
- The cut cone. III: On the role of triangle facets (Q5905548) (← links)
- Delta-systems and qualitative (in)dependence (Q5917474) (← links)
- The cut cone. III: On the role of triangle facets (Q5919846) (← links)