The following pages link to Covering and packing for pairs (Q2349179):
Displaying 20 items.
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Resolvable group divisible designs with large groups (Q727201) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- Generalized laminar families and certain forbidden matrices (Q890016) (← links)
- Nested optimal \(\lambda\)-packings and \(\lambda\)-coverings of pairs with triples (Q1281413) (← links)
- On the PBD-closure of sets containing 3 (Q1302161) (← links)
- Packing of partial designs (Q1323485) (← links)
- On the difference between asymptotically good packings and coverings (Q1345524) (← links)
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko (Q1621060) (← links)
- On balanced \(( \mathbb{Z}_{4 u} \times \mathbb{Z}_{8 v}, \{4, 5 \}, 1)\) difference packings (Q1981675) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Constructing designs straightforwardly: Worst arising cases (Q2713359) (← links)
- Asymptotically maximal packing of \(k\)-sets without double covered pairs (Q2859458) (← links)
- Induced Decompositions of Highly Dense Graphs (Q2940990) (← links)
- (Q4387714) (← links)
- Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families (Q4611006) (← links)
- The Asymptotic Existence of Resolvable Group Divisible Designs (Q4921426) (← links)
- Leaves for packings with block size four (Q5000309) (← links)
- Short k‐radius sequences, k‐difference sequences and universal cycles (Q6187437) (← links)
- Packing cliques in 3‐uniform hypergraphs (Q6187456) (← links)
