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

DOI10.1016/J.DISC.2014.05.010MaRDI QIDQ397162zbMATHOpenAlexFDO

Authors Salvatore Milici, Zsolt Tuza

Publication date 8 August 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

3-pathresolvable graph decomposition3-cycleuniform resolution

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$, or the complete graph minus a 1-factor as appropriate, 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 are either $P_3$ or $K_3$.

Recommendations

• Uniformly resolvable \(\mathcal H\)-designs with \(\mathcal H=\{P_3,P_4\}\)
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• Complex uniformly resolvable decompositions of \(K_v \)
• scientific article; zbMATH DE number 7641237
• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles

Cites work

• scientific article; zbMATH DE number 4006279 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (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
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Maximum uniformly resolvable designs with block sizes 2 and 4
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On resolvable mixed path designs
• 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
• Resolvable path designs
• Small uniformly resolvable designs for block sizes 3 and 4
• The CRC handbook of combinatorial designs
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• 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

(16)

• On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
• A note on uniformly resolvable \(\{P_4, C_6\}\)-designs
• Uniformly resolvable cycle decompositions with four different factors
• Uniformly resolvable \(\mathcal H\)-designs with \(\mathcal H=\{P_3,P_4\}\)
• Decompositions of the 3-uniform hypergraphs \(K_{v}^{(3)}\) into hypergraphs of a certain type
• 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 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?)
• scientific article; zbMATH DE number 5914937 (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
• Resolvable 3-star designs
• Complex uniformly resolvable decompositions of \(K_v \)

This page was built for publication: Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs

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