arXiv Analytics

Sign in

arXiv:1402.4603 [math.CO]AbstractReferencesReviewsResources

Resolvable 3-star designs

Selda Kucukcifci, Giovanni Lo faro, Salvatore Milici, Antoinette Tripodi

Published 2014-02-19Version 1

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

Comments: arXiv admin note: text overlap with arXiv:1310.7403
Categories: math.CO
Subjects: 05B05
Related articles: Most relevant | Search more
arXiv:1402.2087 [math.CO] (Published 2014-02-10, updated 2014-02-20)
Connected Colourings of Complete Graphs and Hypergraphs
arXiv:1010.1455 [math.CO] (Published 2010-10-07)
Nim on the Complete Graph
arXiv:1204.3709 [math.CO] (Published 2012-04-17, updated 2013-10-29)
Decompositions of complete graphs into cycles of arbitrary lengths

Links

Toolbox