On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of t-designs
From MaRDI portal
Publication:604662
Recommendations
Cites work
- scientific article; zbMATH DE number 5302250 (Why is no real title available?)
- scientific article; zbMATH DE number 54782 (Why is no real title available?)
- scientific article; zbMATH DE number 553903 (Why is no real title available?)
- scientific article; zbMATH DE number 731866 (Why is no real title available?)
- scientific article; zbMATH DE number 1052824 (Why is no real title available?)
- scientific article; zbMATH DE number 1123810 (Why is no real title available?)
- scientific article; zbMATH DE number 1996250 (Why is no real title available?)
- scientific article; zbMATH DE number 2149833 (Why is no real title available?)
- scientific article; zbMATH DE number 749274 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 4198000 (Why is no real title available?)
- An infinite class of 5-designs
- Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs
- On the minimum number of blocks defining a design
- On the spectrum of minimal defining sets of full designs
- On the structure of (v,k,t) trades
- Smallest defining sets of some STS(19)
Cited in
(9)- On the spectrum of minimal defining sets of full designs
- Critical sets of full \(n\)-Latin squares
- scientific article; zbMATH DE number 553903 (Why is no real title available?)
- On defining sets of full designs
- On defining sets of full designs with block size three
- Critical sets of 2-balanced Latin rectangles
- Defining sets of full designs with block size three. II
- scientific article; zbMATH DE number 841988 (Why is no real title available?)
- Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs
This page was built for publication: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604662)