Abstract

AbstractA design is said to be super‐simple if the intersection of any two blocks has at most two elements. A design with index is said to be ‐decomposable, if its blocks can be partitioned into nonempty collections , , such that each with the point set forms a design with index . In this paper, it is proved that there exists a ‐decomposable super‐simple ‐BIBD (balanced incomplete block design) if and only if and .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call