Resolvable h-sun designs
Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici, Antoinette, Tripodi
TL;DR
This paper fully characterizes the spectrum of uniformly resolvable decompositions of complete graphs into 1-factors and classes of h-suns, advancing combinatorial design theory.
Contribution
It provides a complete determination of the spectrum for such decompositions, which was previously unknown.
Findings
Spectrum characterized for all parameters
Complete classification of resolvable decompositions
Advances understanding of combinatorial designs
Abstract
In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-suns.
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 · Finite Group Theory Research · Coding theory and cryptography