Let K_v be the complete graph of order v and F be a set of 1-factors of K_v. In this article we study the existence of a resolvable decomposition of K_v-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ε{40,44,52,76,92,100,280,284,328,332,428,472,476,572}.
Resolvable 3-star designs
LO FARO, GiovanniSecondo
;TRIPODI, AntoinetteUltimo
2015-01-01
Abstract
Let K_v be the complete graph of order v and F be a set of 1-factors of K_v. In this article we study the existence of a resolvable decomposition of K_v-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ε{40,44,52,76,92,100,280,284,328,332,428,472,476,572}.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Resolvable 3-star designs.pdf
solo utenti autorizzati
Tipologia:
Versione Editoriale (PDF)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
375.34 kB
Formato
Adobe PDF
|
375.34 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
