Extending large sets of \(t\)-designs
From MaRDI portal
Publication:1924242
DOI10.1006/jcta.1996.0093zbMath0859.05019OpenAlexW2076766493MaRDI QIDQ1924242
Publication date: 7 April 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0093
Related Items (12)
A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) ⋮ Large sets of \(t\)-designs through partitionable sets: a survey ⋮ A new series of large sets of subspace designs over the binary field ⋮ 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\) ⋮ New \(t\)-designs and large sets of \(t\)-designs ⋮ Some infinite families of large sets of \(t\)-designs ⋮ Recursive constructions for \(s\)-resolvable \(t\)-designs ⋮ On the existence of large sets of \(t\)-designs of prime sizes. ⋮ Simple non-trivial designs with an arbitrary automorphism group
This page was built for publication: Extending large sets of \(t\)-designs
