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





Cites Work


Cited In (7)






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)