Resolvable 3-star designs

DOI10.1016/J.DISC.2014.11.013MaRDI QIDQ488286zbMATHzbMATHOpenAlexFDO

Authors Selda Küçükçifçi, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi

Publication date 23 January 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.4603

zbMATH Keywords

resolvable graph decompositionuniform resolutions3-stars

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

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}.

Recommendations

• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
• scientific article; zbMATH DE number 7641237
• A note on uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into 2-stars and 4-cycles
• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
• Resolvable G-designs of order v and index {\lambda}

Cites work

• A note on uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into 2-stars and 4-cycles
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Maximum uniformly resolvable designs with block sizes 2 and 4
• On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
• On uniformly resolvable designs with block sizes 3 and 4
• Small uniformly resolvable designs for block sizes 3 and 4
• The CRC handbook of combinatorial designs
• Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs
• Uniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four
• Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five
• Uniformly resolvable pairwise balanced designs with blocksizes two and three

Cited in

(8)

• Block colourings of star systems
• Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• Uniformly resolvable decompositions of \(K_v\) in 1-factors and 4-stars
• scientific article; zbMATH DE number 7641237 (Why is no real title available?)
• Uniformly resolvable \({P_4, C_k}\)-decomposition of \(K_n\) -- a complete solution
• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
• Uniformly resolvable \((C_4, K_{1,3})\)-designs of index 2

This page was built for publication: Resolvable 3-star designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488286)