The existence of (K₂ K₆)-designs
From MaRDI portal
Recommendations
Cites work
- A resolvable \(r \times c\) grid-block packing and its application to DNA library screening
- An isomorphic factorization of the complete graph
- Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3352656 (Why is no real title available?)
- Pooling, lattice square, and union jack designs
- Resolvable packings ofKvwithK2 × Kc's
- The CRC handbook of combinatorial designs
- The decomposition of \(K_v\) into \(K_2\times K_5\)'s
- The Existence of r\times4 Grid-Block Designs with r=3,4
- The Existence of 2×4 Grid-Block Designs and Their Applications
Cited in
(8)- Improving the existence bounds for grid-block difference families
- Grid-block difference families and related combinatorial structures
- The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216
- scientific article; zbMATH DE number 5139440 (Why is no real title available?)
- scientific article; zbMATH DE number 4070910 (Why is no real title available?)
- scientific article; zbMATH DE number 1779922 (Why is no real title available?)
- scientific article; zbMATH DE number 898424 (Why is no real title available?)
- Block‐transitive designs based on grids
This page was built for publication: The existence of \((K_2\times K_6)\)-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367091)