On the minimum number of blocks defining a design
From MaRDI portal
Publication:3835459
DOI10.1017/S0004972700017883zbMath0679.05006OpenAlexW2151177920MaRDI QIDQ3835459
Publication date: 1990
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700017883
Related Items (13)
A flaw in the use of minimal defining sets for secret sharing schemes ⋮ Complete forcing numbers of primitive coronoids ⋮ On the computational complexity of defining sets ⋮ On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs ⋮ Defining sets of full designs with block size three. II ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ On the spectrum of minimal defining sets of full designs ⋮ On defining sets of full designs with block size three ⋮ On defining sets of full designs ⋮ Random constructions and density results ⋮ On the forced matching numbers of bipartite graphs ⋮ On defining sets for projective planes ⋮ Complete forcing numbers of catacondensed hexagonal systems
Uses Software
Cites Work
This page was built for publication: On the minimum number of blocks defining a design
