Locally trivial t-designs and t-designs without repeated blocks
From MaRDI portal
Publication:1823945
DOI10.1016/0012-365X(89)90372-5zbMath0682.05011MaRDI QIDQ1823945
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Constructing regular self-complementary uniform hypergraphs ⋮ More on halving the complete designs ⋮ A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) ⋮ Large sets of \(t\)-designs through partitionable sets: a survey ⋮ An extending theorem for \(s\)-resolvable \(t\)-designs ⋮ All block designs with \(b={v\choose k}/2\) exist ⋮ Bounds and constructions of \(t\)-spontaneous emission error designs ⋮ Generalized packing designs ⋮ Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index ⋮ Probabilistic existence of large sets of designs ⋮ Large sets of \(t\)-designs over finite fields ⋮ Large sets of subspace 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)\) ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Simple \(t\)-designs: a recursive construction for arbitrary \(t\) ⋮ Some new 6-(14, 7, 4) designs ⋮ Large sets with multiplicity ⋮ Generalized covering designs and clique coverings ⋮ Optimization, block designs and no free lunch theorems ⋮ New \(t\)-designs and large sets of \(t\)-designs ⋮ A generalisation of \(t\)-designs ⋮ Hamiltonicity and restricted block-intersection graphs of \(t\)-designs ⋮ A family of 4-designs with block size 9 ⋮ Recursive constructions for \(s\)-resolvable \(t\)-designs ⋮ Simple non-trivial designs with an arbitrary automorphism group
Cites Work
- Unnamed Item
- Unnamed Item
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On large sets of disjoint Steiner triple systems. VI
- Non-SUSY \(p\)-branes, bubbles and tubular branes
- The existence of simple \(6\text{-}(14,7,4)\) designs
- Some balanced complete block designs
- Intersections among Steiner systems
- On the maximum number of disjoint triple systems
- A Small 4-Design
- Intersection Properties of Steiner Systems
