Searcharxiv⌕ Search

arXiv subjects

Salvatore Milici

Publications and source records attributed to Salvatore Milici.

7 recordsLinked to original sources

Complex uniformly resolvable decompositions of $K_v$

In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set $\mathcal H$. We completely determine the spectrum for the cases $\mathcal{H} = \{K_2, P_3, K_3\}$, $\mathcal{H} = \{P_4, C_4\}$, and $\mathcal{H} = \{K_2, P_4, C_4\}$.

math.CO↗

Resolvable h-sun designs

In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-suns.

math.CO↗

Resolvable G-designs of order v and index λ

In this paper we consider the problem concerning the existence of a resolvable G-design of order v and index λ. We solve the problem for the cases in which G is a connected subgraph of K_4.

math.CO↗

Resolvable 3-star designs

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

math.CO↗

Uniformly resolvable decompositions of $K_v$ into $P_3$ and $K_3$ graphs

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

math.CO↗

Maximum uniformly resolvable decompositions of $K_v$ and $K_v - I$ into 3-stars and 3-cycles

Let $K_v$ denote the complete graph of order $v$ and $K_v - I$ denote $K_v$ minus a 1-factor. In this article we investigate uniformly resolvable decompositions of $K_v$ and $K_v-I$ into $r$ classes containing only copies of $3$-stars and $s$ classes containing only copies of $3$-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum.

math.CO↗