On the minimum number of blocks defining a design
From MaRDI portal
Publication:3835459
Recommendations
Cites work
Cited in
(32)- Random constructions and density results
- On the forced matching numbers of bipartite graphs
- The minimum independence number for designs
- Defining sets of full designs with block size three. II
- Complete forcing numbers of catacondensed hexagonal systems
- On the computational complexity of defining sets
- On the spectrum of minimal defining sets of full designs
- On defining sets for projective planes
- Minimal defining sets for full 2-(v,3,v-2) designs
- scientific article; zbMATH DE number 994589 (Why is no real title available?)
- scientific article; zbMATH DE number 2128112 (Why is no real title available?)
- Complete forcing numbers of primitive coronoids
- scientific article; zbMATH DE number 1191222 (Why is no real title available?)
- scientific article; zbMATH DE number 68556 (Why is no real title available?)
- Some results on defining sets of t-designs
- scientific article; zbMATH DE number 1334631 (Why is no real title available?)
- scientific article; zbMATH DE number 1339502 (Why is no real title available?)
- scientific article; zbMATH DE number 540103 (Why is no real title available?)
- scientific article; zbMATH DE number 553903 (Why is no real title available?)
- scientific article; zbMATH DE number 653267 (Why is no real title available?)
- scientific article; zbMATH DE number 1051273 (Why is no real title available?)
- scientific article; zbMATH DE number 1076135 (Why is no real title available?)
- scientific article; zbMATH DE number 749274 (Why is no real title available?)
- scientific article; zbMATH DE number 828012 (Why is no real title available?)
- scientific article; zbMATH DE number 4198000 (Why is no real title available?)
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
- Complete forcing numbers of complete and almost-complete multipartite graphs
- Hardness of pre-assignment problem for unique minimum vertex cover on planar graphs with maximum degree 3
- On defining sets of full designs
- The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
- A flaw in the use of minimal defining sets for secret sharing schemes
- On defining sets of full designs with block size three
This page was built for publication: On the minimum number of blocks defining a design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835459)