Uniformly resolvable $(C_4, K_{1,3})$-designs of order $v$ and index $2$
M. Gionfriddo, S. Kucukcifci, S. Milici, E. S. Yazici

TL;DR
This paper fully characterizes the spectrum of uniformly resolvable decompositions of the complete graph with index 2 into classes of either 4-cycles or stars with three leaves, providing a comprehensive understanding of such designs.
Contribution
It completely determines the spectrum for uniformly resolvable decompositions of $2K_v$ into $C_4$ or $K_{1,3}$ classes, a novel and comprehensive result.
Findings
Spectrum fully determined for all cases
Decomposition exists for all specified parameters
Provides a complete classification of such designs
Abstract
In this paper we consider the uniformly resolvable decompositions of the complete graph into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases in which all the resolution classes are either or .
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
