Author:
Bang Chang Mo,Sharp H.,Winkler P. M.
Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. D. E. Daykin, Problem E2654,Amer. Math. Monthly
84 (1977), 386.
2. D. E. Daykin, Minimum subcover of a cover of a finite set (solution of Problem E2654),Amer. Math. Monthly
85 (1978), 766.
3. A. Ehrenfeucht, V. Faber andG. J. Simmons, Projective designs,Ars Combinatoria. (To appear)
4. P. Erdős, Chao Ko andR. Rado, Intersection theorem for systems of finite sets,Quarterly J. Math.
12 (1961), 313–320.MR
21 # 1288
5. D. M. Silberger, Uniformly deep families ofk-membered subsets ofn, J. Combinatorial Theory Ser. A
22 (1977), 31–37.MR
54 # 12533
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multiply-intersecting families;Journal of Combinatorial Theory, Series B;1991-11
2. Matchings and covers in hypergraphs;Graphs and Combinatorics;1988-12
3. t-expansive andt-wise intersecting hypergraphs;Graphs and Combinatorics;1986-12