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

DOI10.1016/J.DISC.2014.05.010zbMATH Open1296.05166arXiv1312.2113OpenAlexW2151689454MaRDI QIDQ397162FDOQ397162

Salvatore Milici, Zsolt Tuza

Publication date: 8 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Maximum uniformly resolvable designs with block sizes 2 and 4
• Uniformly resolvable pairwise balanced designs with blocksizes two and three
• Graph decompositions, handcuffed prisoners and balanced p-designs
• 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 bipartite 2-factorizations of kn − I and the Oberwolfach problem
• On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
• Small Uniformly Resolvable Designs for Block Sizes 3 and 4
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Resolvable path designs
• Existence of resolvable path designs
• On resolvable mixed path designs

Cited In (14)

• Title not available (Why is that?)
• 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
• On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
• Resolvable 3-star designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complex uniformly resolvable decompositions of K_v
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• 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 cycle decompositions with four different factors
• Title not available (Why is that?)
• Title not available (Why is that?)

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)