Abstract
We propose and study the problem of finding the smallest nonnegative integer s such that a GDD ( m , n , 3 ; 0 , λ ) can be embedded into a BIBD ( m n + s , 3 , λ ) . We find the values of s for all cases except for the case where n ≡ 5 ( mod 6 ) and m ≡ 1 , 3 ( mod 6 ) and m ≥ 3 , which remains as an open problem.
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 callMore From: Journal of Combinatorial Mathematics and Combinatorial Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
