Abstract
The intersection problem is one of the basic problems in combinatorial design theorys. In this paper, two cases of resolvable balanced incomplete block designs of size four are investigated. As the basic step of the study on the intersection problem for resolvable balanced incomplete block designs, we have determined some values of the intersection numbers. It will play an important role on the further recursive constructions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
