Resolvable G-designs of order v and index {\lambda}
Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici, Antoinette, Tripodi
TL;DR
This paper investigates the existence of resolvable G-designs of order v and index λ, providing solutions specifically for cases where G is a connected subgraph of K_4.
Contribution
It offers new existence results for resolvable G-designs when G is a connected subgraph of K_4, advancing combinatorial design theory.
Findings
Solved the existence problem for G being a connected subgraph of K_4
Provided explicit constructions for certain parameters
Extended the theory of resolvable G-designs
Abstract
In this paper we consider the problem concerning the existence of a resolvable G-design of order v and index {\lambda}. We solve the problem for the cases in which G is a connected subgraph of K_4.
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 · Optimal Experimental Design Methods