Complex uniformly resolvable decompositions of K_v

DOI10.26493/1855-3974.2288.A20zbMATH Open1479.05297arXiv2003.10032OpenAlexW3148198512MaRDI QIDQ5013340FDOQ5013340

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)

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

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

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_3\) and \(K_3\) graphs
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• scientific article; zbMATH DE number 7641237

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)

Cites Work

• The CRC handbook of combinatorial designs
• Maximum uniformly resolvable designs with block sizes 2 and 4
• Uniformly resolvable pairwise balanced designs with blocksizes two and three
• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
• On uniformly resolvable designs with block sizes 3 and 4
• A note on uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into 2-stars and 4-cycles
• On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
• Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• Existence of resolvable path designs
• Uniformly resolvable designs with block sizes 3 and 4
• Uniformly resolvable \(\mathcal H\)-designs with \(\mathcal H=\{P_3,P_4\}\)
• Title not available (Why is that?)
• Uniformly resolvable decompositions of \(K_v\) in 1-factors and 4-stars

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_3\) and \(K_3\) 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)