The Intersection problem for 2-(v; 5; 1) directed block designs
Nasrin Soltankhah, somaye ahmadi

TL;DR
This paper addresses the intersection problem for 2-(v, 5, 1) directed block designs, extending previous work on designs with smaller block sizes, and provides solutions for this specific class of directed designs.
Contribution
The paper solves the intersection problem for 2-(v, 5, 1) directed designs, a case not previously addressed in the literature.
Findings
Determined intersection properties for 2-(v, 5, 1) directed designs.
Extended understanding of intersection problems in directed block designs.
Built upon prior solutions for smaller block sizes.
Abstract
The intersection problem for a pair of 2-(v, 3, 1) directed designs and 2-(v, 4, 1) directed designs is solved by Fu in 1983 and by Mahmoodian and Soltankhah in 1996, respectively. In this paper we determine the intersection problem for 2-(v, 5, 1) directed designs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Optimization and Packing Problems · Optimal Experimental Design Methods
