Koc University Digital Collections
metadata only
The intersection problem for PBD(5*,3)s
For every v equivalent to 5 (mod 6) there exists a pairwise balanced design (PBD) of order v with exactly one block of size 5 and the rest of size 3. We will refer to such a PBD as a PBD(5*, 3). A flower in a PBD(5*, 3) is the set of all blocks containing a given point. If (S, B) is a PBD(5*, 3) and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Block-Transitive $5$-$(v,k,2)$ Designs with $k$ divides $v$#1131814
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#819736
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#809740
- Minimum blockers for nonnested perfect matchings#1083915
- 3-Group divisible designs with block size 4 and 2 groups#938438
Record · ID 955104
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive