A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

DOI10.1016/j.disc.2014.02.009zbMath1288.05034arXiv1310.0992OpenAlexW2075223139MaRDI QIDQ2449136

Tran van Trung, Douglas R. Stinson, Colleen M. Swanson

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.0992

zbMATH Keywords

3-designresolvable design

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (3)

Construction of 3-designs using \((1,\sigma)\)-resolution ⋮ Additional constructions to solve the generalized Russian cards problem using combinatorial designs ⋮ On simple 3-designs having 2-resolutions

Cites Work

• Unnamed Item
• Unnamed Item
• On resolvable designs \(S_ 3(3;4,v)\)
• The existence of simple \(S_ 3(3,4,\nu)\)
• Unifying some known infinite families of combinatorial 3-designs
• Recursive constructions for 3-designs and resolvable 3-designs

This page was built for publication: A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs