Complex uniformly resolvable decompositions of K_v

DOI10.26493/1855-3974.2288.A20MaRDI QIDQ5013340zbMATH OpenOpenAlexFDO

Authors Csilla Bujtás, Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Zsolt Tuza, Salvatore Milici

Publication date 30 November 2021

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

cyclepathresolvable decompositioncomplex uniformly resolvable decomposition

Mathematics Subject Classification ID

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

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 $mathcalH$. We completely determine the spectrum for the cases $mathcalH=K_2,P_3,K_3$, $mathcalH=P_4,C_4$, and $mathcalH=K_2,P_4,C_4$.

Recommendations

• Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
• Uniformly resolvable decompositions of \(K_n\) into 1-factors and \(P_k\)-factors
• 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
• scientific article; zbMATH DE number 7641237

Cites work

• scientific article; zbMATH DE number 6476715 (Why is no real title available?)
• A note on uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into 2-stars and 4-cycles
• Existence of resolvable path designs
• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
• 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
• The CRC handbook of combinatorial designs
• Uniformly resolvable \(\mathcal H\)-designs with \(\mathcal H=\{P_3,P_4\}\)
• Uniformly resolvable decompositions of \(K_v\) in 1-factors and 4-stars
• 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 designs with block sizes 3 and 4
• Uniformly resolvable pairwise balanced designs with blocksizes two and three

Cited in

(4)

• Uniformly resolvable decompositions of \(K_n\) into 1-factors and \(P_k\)-factors
• Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
• Uniformly resolvable \((C_4, K_{1,3})\)-designs of index 2

This page was built for publication: Complex uniformly resolvable decompositions of \(K_v \)

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