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

DOI10.1007/s10623-022-01056-wOpenAlexW4281476894WikidataQ114849730 ScholiaQ114849730MaRDI QIDQ2153749

Tran van Trung

Publication date: 13 July 2022

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

Full work available at URL: https://doi.org/10.1007/s10623-022-01056-w

zbMATH Keywords

projective planeSteiner 2-design\(s\)-resolvable \(t\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large sets of projective planes of orders 3 and 4
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On simple 3-designs having 2-resolutions
• The existence of simple \(6\text{-}(14,7,4)\) designs
• Extending t-designs
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Some new 2-resolvable Steiner quadruple systems
• A recursive construction for simple \(t\)-designs using resolutions
• Locally trivial t-designs and t-designs without repeated blocks
• Partitions of the 4-subsets of a 13-set into disjoint projective planes
• Extending large sets of \(t\)-designs
• Recursive constructions for \(s\)-resolvable \(t\)-designs
• An infinite class of 5-designs
• An extending theorem for \(s\)-resolvable \(t\)-designs
• New large sets oft-designs with prescribed groups of automorphisms

This page was built for publication: A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)