Complex uniformly resolvable decompositions of K_v

2020/03/23 by Bujtàs, Csilla, Gionfriddo, Mario, Guardo, Elena +3
#05C38 #05C51 #05C70 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2003.10032

Abstract

In this paper we consider the complex uniformly resolvable decompositions of the complete graph K_v into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set \mathcal H. We completely determine the spectrum for the cases H = \K₂, P₃, K₃\, H = \P₄, C₄\, and H = \K₂, P₄, C₄\.

Related

• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
• Uniformly resolvable decompositions of K_v into paths on two, three and four vertices
• Uniformly resolvable (C₄, K_1,3)-designs of order v and index 2
• Uniformly resolvable decompositions of K_v-I into 5-stars
• Uniformly resolvable decompositions of K_v into one 1-factor and n-stars when n>1 is odd