paper

The 3-way intersection problem for S(2, 4, v) designs

arXiv:1301.4764

Abstract

In this paper the 3-way intersection problem for designs is investigated. Let and . Let there exist three designs with same common blocks. We show that for any positive integer and , for and . We find completely. Also we determine some values of for and 40.

accepted in Utilitas mathematics

The 3-way intersection problem for S(2, 4, v) designs · wovepaper