Constructing and Deconstructing Latin Trades

This paper discusses existence results for latin trades and provides a Glueing Construction which is subsequently used to construct all latin trades of finite order greater than three.

Trades and Graphs

The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.