The flower intersection problem for S(2,4,v)'s
From MaRDI portal
Publication:393170
DOI10.1016/J.DISC.2013.10.012zbMATH Open1278.05032OpenAlexW2202910546MaRDI QIDQ393170FDOQ393170
Authors: Guizhi Zhang, Yanxun Chang, Tao Feng
Publication date: 16 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.012
Recommendations
Cites Work
- Balanced incomplete block designs and related designs
- Title not available (Why is that?)
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Title not available (Why is that?)
- Intersections among Steiner systems
- The flower intersection problem for Kirkman triple systems
- Title not available (Why is that?)
- Intersection Properties of Steiner Systems
- Title not available (Why is that?)
- Steiner Triple Systems Having a Prescribed Number of Triples in Common*: Corrigendum
- Title not available (Why is that?)
- The triangle intersection problem for \(S(2,4,v)\) designs
Cited In (6)
- The disjoint \(m\)-flower intersection problem for Latin squares
- The 3-way flower intersection problem for Steiner triple systems
- The flower intersection problem for Kirkman triple systems
- The intersection problem for kite-GDDs of type \(2^u\)
- The number of common flowers of two \(STS(\nu)\)s and embeddable Steiner triple trades
- Title not available (Why is that?)
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)