The 3-way intersection problem for S(2, 4, v) designs
Combinatorics
2013-01-22 v1
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.
Cite
@article{arxiv.1301.4764,
title = {The 3-way intersection problem for S(2, 4, v) designs},
author = {Saeedeh Rashidi and Nasrin Soltankhah},
journal= {arXiv preprint arXiv:1301.4764},
year = {2013}
}
Comments
accepted in Utilitas mathematics