Resolvable 3-star designs
From MaRDI portal
Publication:488286
DOI10.1016/J.DISC.2014.11.013zbMATH Open1305.05192arXiv1402.4603OpenAlexW2073341599MaRDI QIDQ488286FDOQ488286
Antoinette Tripodi, Selda Küçükçifçi, Salvatore Milici, Giovanni Lo Faro
Publication date: 23 January 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1- factors, with the possible exception of v in {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}.
Full work available at URL: https://arxiv.org/abs/1402.4603
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Cites Work
- 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 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
- Small Uniformly Resolvable Designs for Block Sizes 3 and 4
Cited In (7)
- Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
- Block colourings of star systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
This page was built for publication: Resolvable 3-star designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488286)