On simple 3-designs having 2-resolutions

DOI10.1016/J.DISC.2020.111963zbMATH Open1443.05027OpenAlexW3027516762MaRDI QIDQ776286FDOQ776286

Authors: Tran van Trung 

Publication date: 8 July 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111963

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

zbMATH Keywords

\(s\)-resolvable \(t\)-design2-resolutionsimple 3-design

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites Work

• Title not available (Why is that?)
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Unifying some known infinite families of combinatorial 3-designs
• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
• Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
• Title not available (Why is that?)
• Some new 2-resolvable Steiner quadruple systems
• Title not available (Why is that?)
• A recursive construction for simple \(t\)-designs using resolutions
• Recursive constructions for \(s\)-resolvable \(t\)-designs
• An infinite class of 4-designs

Cited In (4)

• A Construction of a Resolvable 3-Design
• A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
• Recursive constructions for 3-designs and resolvable 3-designs
• Unifying some known infinite families of combinatorial 3-designs

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)