The following pages link to (Q4026151):
Displayed 38 items.
- Relations between the differential and parameters in graphs (Q283724) (← links)
- Generalized packing designs (Q385379) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Remoteness of permutation codes (Q427818) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Orbital branching (Q623461) (← links)
- Switching codes and designs (Q658111) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- Pair covering designs with block size 5 (Q879393) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- Error-correcting codes from permutation groups (Q1043942) (← links)
- Single change covering designs (Q1209218) (← links)
- Covering graphs: The covering problem solved (Q1269896) (← links)
- General upper bounds on the minimum size of covering designs (Q1291117) (← links)
- The last packing number of quadruples, and cyclic SQS (Q1309825) (← links)
- Some recent developments on BIBDs and related designs (Q1313979) (← links)
- On \(\lambda\)-covers of pairs by quintuples: \(v\) odd (Q1331137) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- Existence of \((v,\{5,w^*\},1)\)-PBDs. (Q1428515) (← links)
- Some \(t\)-designs are minimal \((t+1)\)-coverings (Q1584345) (← links)
- A general construction for optimal cyclic packing designs (Q1604562) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- Optimal covering designs: complexity results and new bounds (Q1765237) (← links)
- On erasure combinatorial batch codes (Q1783704) (← links)
- Packing pairs by quintuples: The case of zero congruence mod 4 (Q1804219) (← links)
- Quorum systems constructed from combinatorial designs (Q1854450) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- Suitable sets of permutations, packings of triples, and Ramsey's theorem (Q2011141) (← links)
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration (Q2324782) (← links)
- On the non-existence of pair covering designs with at least as many points as blocks (Q2428629) (← links)
- Latin squares with bounded size of row prefix intersections (Q2492205) (← links)
- Bin Packing with Colocations (Q2971155) (← links)
- An improvement on covering triples by quadruples (Q3503599) (← links)
- A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into <i>K</i><sub>50</sub> (Q4452471) (← links)
- Leaves for packings with block size four (Q5000309) (← links)
- The independent domination numbers of strong product of two cycles (Q5031932) (← links)
- Packing designs with equal-sized holes (Q5934189) (← links)