Maximum uniformly resolvable decompositions of K-v and K-v

Department of Mathematics2024-11-0920150012-365X10.1016/j.disc.2014.05.0162-s2.0-84930197623https://hdl.handle.net/20.500.14288/1908Let K-v denote the complete graph of order v and K-v - I denote K-v minus a 1-factor. In this article we investigate uniformly resolvable decompositions of K-v and K-v - I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum.pdfApplied mathematicsMathematicsMaximum uniformly resolvable decompositions of K-v and K-v - I into 3-stars and 3-cyclesJournal Article1872-681Xhttps://doi.org/10.1016/j.disc.2014.05.016358092000003Q3NOIR01057