Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the edges of Kv into isomorphic copies of graphs from H (also called blocks) in such a way that all blocks in a given parallel class are isomorphic to the same graph from H. We consider the case H = (K1;2;K1;3), and prove that the necessary conditions on the existence of such designs are also sufficient.
On uniformly resolvable (K_(1,2);K_(1,3)-designs
Milici S.
;
2018-01-01
Abstract
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the edges of Kv into isomorphic copies of graphs from H (also called blocks) in such a way that all blocks in a given parallel class are isomorphic to the same graph from H. We consider the case H = (K1;2;K1;3), and prove that the necessary conditions on the existence of such designs are also sufficient.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
