Uniformly resolvable decompositions of K_v into paths on two, three and four vertices

2014/06/17 by Giovanni Lo Faro, Faro, Giovanni Lo, Salvatore Milici +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1406.4279

arXiv admin note: text overlap with arXiv:1312.2113

arxiv created 2014/06/17 · openalex publication_date 2014/06/17 · arxiv updated 2014/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we consider uniformly resolvable decompositions of the complete graph K_v into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes consist of either P₂, P₃ and P₄.

Citations

• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs

Related

• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
• Complex uniformly resolvable decompositions of K_v
• 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