The flower intersection problem for S(2,4,v)'s
From MaRDI portal
(Redirected from The flower intersection problem for S(2,4,v)'s)
The flower intersection problem for \(S(2,4,v)\)'s
The flower intersection problem for \(S(2,4,v)\)'s
Recommendations
Cites work
- Balanced incomplete block designs and related designs
- scientific article; zbMATH DE number 5130671 (Why is no real title available?)
- scientific article; zbMATH DE number 4104964 (Why is no real title available?)
- scientific article; zbMATH DE number 68342 (Why is no real title available?)
- scientific article; zbMATH DE number 165087 (Why is no real title available?)
- scientific article; zbMATH DE number 933175 (Why is no real title available?)
- Intersection Properties of Steiner Systems
- Intersections among Steiner systems
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Steiner Triple Systems Having a Prescribed Number of Triples in Common*: Corrigendum
- The flower intersection problem for Kirkman triple systems
- The triangle intersection problem for S(2,4,v) designs
Cited in
(7)- The flower intersection problem for Kirkman triple systems
- The number of common flowers of two \(STS(\nu)\)s and embeddable Steiner triple trades
- scientific article; zbMATH DE number 4212048 (Why is no real title available?)
- scientific article; zbMATH DE number 4104964 (Why is no real title available?)
- The intersection problem for kite-GDDs of type \(2^u\)
- The 3-way flower intersection problem for Steiner triple systems
- The disjoint \(m\)-flower intersection problem for Latin squares
This page was built for publication: The flower intersection problem for \(S(2,4,v)\)'s
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393170)