Author:
Hall Marshall,Ryser H. J.
Abstract
Let it be required to arrange v elements into v sets such that each set
contains exactly k distinct elements and such that each pair of sets has exactly λ
elements in common (0 < λ < k < v). This problem we refer to
as the v, k,λ combinatorial problem.
Publisher
Canadian Mathematical Society
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Existing Problem for Symmetric Design: Bruck Ryser Chowla Theorem;Sakarya University Journal of Science;2022-02-10
2. A survey of the multiplier conjecture;Designs, Codes and Cryptography;2015-12-07
3. A multiplier theorem;Journal of Combinatorial Theory, Series A;2014-05
4. Symmetric 112-Designs and 112-Difference Sets;Journal of Combinatorial Designs;2013-06-10
5. Bibliography;Combinatorial Theory;2011-08-22