Locally trivial t-designs and t-designs without repeated blocks

Recommendations

scientific article; zbMATH DE number 4116543
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint)
scientific article; zbMATH DE number 3941553
scientific article; zbMATH DE number 822741
Publication:5753960
A generalisation of \(t\)-designs
\(t\)-designs with the number of blocks close to the Fisher type lower bound
scientific article; zbMATH DE number 638676
Graphical t-designs with block sizes three and four

Cites work

scientific article; zbMATH DE number 3882436 (Why is no real title available?)
scientific article; zbMATH DE number 3845586 (Why is no real title available?)
A Small 4-Design
Intersection Properties of Steiner Systems
Intersections among Steiner systems
Non-SUSY \(p\)-branes, bubbles and tubular branes
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
On large sets of disjoint Steiner triple systems. VI
On the maximum number of disjoint triple systems
Some balanced complete block designs
The existence of simple \(6\text{-}(14,7,4)\) designs

Cited in

(30)

Recursive constructions for \(s\)-resolvable \(t\)-designs
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
A family of 4-designs with block size 9
Simple non-trivial designs with an arbitrary automorphism group
scientific article; zbMATH DE number 4116543 (Why is no real title available?)
All block designs with \(b={v\choose k}/2\) exist
Large sets of t-designs through partitionable sets: a survey
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)\)
Constructing regular self-complementary uniform hypergraphs
Generalized packing designs
Restricted simple 1-designs
Large sets of subspace designs
New \(t\)-designs and large sets of \(t\)-designs
A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
A generalisation of \(t\)-designs
Generalized covering designs and clique coverings
scientific article; zbMATH DE number 3937186 (Why is no real title available?)
Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
An extending theorem for \(s\)-resolvable \(t\)-designs
Optimization, block designs and no free lunch theorems
Large sets with multiplicity
Bounds and constructions of \(t\)-spontaneous emission error designs
Large sets of \(t\)-designs over finite fields
Mutually disjoint Steiner systems from BCH codes
Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
Hamiltonicity and restricted block-intersection graphs of \(t\)-designs
Some new 6-(14, 7, 4) designs
A recursive construction for simple \(t\)-designs using resolutions
Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
More on halving the complete designs

This page was built for publication: Locally trivial t-designs and t-designs without repeated blocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823945)