On uniformly resolvable {K1,2, K1,3}-designs

Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi

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.

Keywords


Resolvable Graph Decomposition; Uniformly Resolvable Designs; Stars

Full Text:

PDF


DOI: https://doi.org/10.1478/AAPP.96S2A9

Copyright (c) 2018 Salvatore Milici, Giovanni Lo Faro, Antoinette Tripodi

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.