Sharif Digital Repository

The so-called intersection problem has been considered for many different combinatorial structures, including Latin squares. This intersection problem basically takes a pair of structures, with the same parameters and based on the same underlying set, and determines the possible number of common sub-objects (such as blocks, entries, etc.) which they may have. The intersection problem has also been extended from consideration of pairs of combinatorial structures to sets of three, or even sets of , where may be larger than 3. In this thesis, we study the related problem of determining, for all orders n, the set of integers k for which there exists = 4 Latin squares of order n having...