Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
From MaRDI portal
Publication:579265
DOI10.1016/0012-365X(87)90061-6zbMath0625.05005MaRDI QIDQ579265
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
05B05: Combinatorial aspects of block designs
Related Items
Large sets of \(t\)-designs through partitionable sets: a survey, Classification of partitions of all triples on ten points into copies of Fano and affine planes, Vertex-transitive self-complementary uniform hypergraphs of prime order, Optimization, block designs and no free lunch theorems, Hamiltonicity and restricted block-intersection graphs of \(t\)-designs, Codes and designs -- existence and uniqueness, A prospect for a general method of constructing \(t\)-designs, New \(t\)-designs and large sets of \(t\)-designs, Block transitive resolutions of \(t\)-designs and Room rectangles, Designs in a coset geometry: Delsarte theory revisited., The family of block designs with some combinatorial properties, Orthogonal decomposition and packing of complete graphs, Locally trivial t-designs and t-designs without repeated blocks, Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I, Simple non-trivial designs with an arbitrary automorphism group, Intersecting designs, Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\), Conformal designs based on vertex operator algebras, On balanced incomplete-block designs with repeated blocks
Cites Work
