An extending theorem for \(s\)-resolvable \(t\)-designs

DOI10.1007/s10623-020-00835-7zbMath1471.05013OpenAlexW3122972160MaRDI QIDQ2657143

Tran van Trung

Publication date: 17 March 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00835-7

zbMATH Keywords

\(s\)-resolvable \(t\)-designextending theorem

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (1)

A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Combining \(t\)-designs
• A recursive construction for simple \(t\)-designs using resolutions
• Locally trivial t-designs and t-designs without repeated blocks
• Intersections among Steiner systems
• Recursive constructions for \(s\)-resolvable \(t\)-designs
• Mutually disjoint designs and new 5-designs derived from groups and codes
• Towards a Large Set of Steiner Quadruple Systems
• A few more large sets oft-designs
• An infinite family of (simple) 6‐designs

This page was built for publication: An extending theorem for \(s\)-resolvable \(t\)-designs