Recursive constructions for s-resolvable t-designs
From MaRDI portal
Publication:2334440
Recommendations
- A recursive construction for simple \(t\)-designs using resolutions
- Resolvable \(t\)-designs
- An extending theorem for \(s\)-resolvable \(t\)-designs
- A construction for resolvable designs and its generalizations
- Recursive constructions for 3-designs and resolvable 3-designs
- Publication:4723750
- Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
- scientific article; zbMATH DE number 749295
- Some tuple system constructions with applications to resolvable designs
Cites work
- scientific article; zbMATH DE number 4047735 (Why is no real title available?)
- scientific article; zbMATH DE number 91037 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- scientific article; zbMATH DE number 1877033 (Why is no real title available?)
- scientific article; zbMATH DE number 874485 (Why is no real title available?)
- scientific article; zbMATH DE number 238435 (Why is no real title available?)
- A family of 4-designs with block size 9
- A new family of 4-designs
- A recursive construction for simple \(t\)-designs using resolutions
- An infinite class of 4-designs
- Combining \(t\)-designs
- Extending large sets of \(t\)-designs
- Locally trivial t-designs and t-designs without repeated blocks
- New infinite families of simple 5-designs
- New large sets of \(t\)-designs
- New large sets oft-designs with prescribed groups of automorphisms
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
- On the existence of an infinite family of simple 5-designs
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Semiregular large sets
- Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
- Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
- Some new 2-resolvable Steiner quadruple systems
- Steiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\)
- The CRC handbook of combinatorial designs
Cited in
(18)- Resolvable \(t\)-designs
- On resolvable designs \(S_ 3(3;4,v)\)
- On t‐designs and s‐resolvable t‐designs from hyperovals
- Recursive constructions for 3-designs and resolvable 3-designs
- On simple 3-designs having 2-resolutions
- Resolvability of infinite designs
- Some new families of 2-resolutions
- An extending theorem for \(s\)-resolvable \(t\)-designs
- scientific article; zbMATH DE number 2149825 (Why is no real title available?)
- A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
- A recursive construction for simple \(t\)-designs using resolutions
- Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
- Construction of 3-designs using \((1,\sigma)\)-resolution
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
- Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
- Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
- Partially balanced t-designs
- Resolutions of the designs in two infinite series of 4-designs
This page was built for publication: Recursive constructions for \(s\)-resolvable \(t\)-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334440)
