A latin bitrade is a pair of partial latin squares which are disjoint, occupy the same set of non-
empty cells, and whose corresponding rows and columns contain the same sets of symbols …

The concept of a trade in a combinatorial structure has existed for some years now.
However, in the last five years or so there has been a great deal of activity in the area. This …

A $\mu $-way $(v, k, t) $$ trade $ of volume $ m $ consists of $\mu $ disjoint collections $
T_1 $, $ T_2,\dots T_ {\mu} $, each of $ m $ blocks, such that for every $ t $-subset of $ v …

Abstract A 3-way (v, k, t) trade of volume s consists of 3 disjoint collections T 1, T 2 and T 3,
each of s blocks, such that for every t-subset of v-set V, the number of blocks containing this t …

A 3-way T-trade consists of three disjoint decompositions of some simple graph H without
isolated vertices into copies of T. The number of vertices of the graph H is the foundation of …

Latin trades are closely related to the problem of critical sets in Latin squares. We denote the
cardinality of the smallest critical set in any Latin square of order n by scs (n). A …

A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ disjoint decompositions of some
simple (underlying) graph $ H $ into copies of a graph $ G. $ The number of copies of the …

Edge-colorings of graphs have a rich history and are widely studied. Trade spectra of graphs
are relatively new and ripe for study. The color-trade-spectrum of a graph G is defined to be …

A µ-way G-trade (µ≥ 2) consists of µ disjoint decompositions of some simple (underlying)
graph H into copies of a graph G. The number of copies of the graph G in each of the …

A paper by Cavenagh and Wanless diagnosed the possible intersection of any two
transversals of the back circulant Latin square B_n, and used the result to completely …