Recommendations
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
- Recursive constructions for \(s\)-resolvable \(t\)-designs
- Recursive constructions for 3-designs and resolvable 3-designs
- scientific article; zbMATH DE number 17504
- A recursive construction for simple \(t\)-designs using resolutions
Cites work
- scientific article; zbMATH DE number 3882436 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3205799 (Why is no real title available?)
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
- A recursive construction for simple \(t\)-designs using resolutions
- An infinite class of 4-designs
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Recursive constructions for \(s\)-resolvable \(t\)-designs
- Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
- Some new 2-resolvable Steiner quadruple systems
- Unifying some known infinite families of combinatorial 3-designs
Cited in
(9)- Unifying some known infinite families of combinatorial 3-designs
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
- A Construction of a Resolvable 3-Design
- Construction of 3-designs using (1,)-resolution
- A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
- An extending theorem for \(s\)-resolvable \(t\)-designs
- Recursive constructions for 3-designs and resolvable 3-designs
- Some new families of 2-resolutions
- A recursive construction for simple \(t\)-designs using resolutions
This page was built for publication: On simple 3-designs having 2-resolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776286)
