Consider K6, the complete graph on 6 vertices. We partition the graph into three non-isomorphic subgraphs with no isolated vertices. This is a graph triple of order six. The multidesign problem is to take another graph and partition it into copies of the triple using at least one of each triple. This proposal will allow the pursuit of mathematical research that is out of my area of expertise. I plan to learn more about multidesigns of graph triples of order 6, in particular to find the multidesigns of Kn and of Cartesian and tensor products of graphs. The proposal includes summer salary to learn what has been done so far in the area of multidesigns as well as travel support to conferences to work with and learn from other graph theorists in the area of multidesigns.