A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs (Q2449136): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4063504 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unifying some known infinite families of combinatorial 3-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On resolvable designs \(S_ 3(3;4,v)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The existence of simple \(S_ 3(3,4,\nu)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5331658 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive constructions for 3-designs and resolvable 3-designs / rank | |||
Normal rank |
Latest revision as of 12:27, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs |
scientific article |
Statements
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs (English)
0 references
6 May 2014
0 references
3-design
0 references
resolvable design
0 references