Resolvable 3-star designs

2014/02/19 by Selda Küçükçi̇fçi̇, Giovanni Lo Faro, Kucukcifci, Selda +5
Engineering · #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1402.4603

Abstract

Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1- factors, with the possible exception of v in 40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572.

Related

• Uniformly resolvable decompositions of K_v into 1-factors and odd n-star factors
• Maximum uniformly resolvable decompositions of K_v and K_v - I into 3-stars and 3-cycles
• Uniformly resolvable decompositions of K_v into one 1-factor and n-stars when n>1 is odd
• Resolvable h-sun designs
• Uniformly resolvable (C₄, K_1,3)-designs of order v and index 2