Discrete Mathematics and Combinatorics Commons^™

Partially Filled Latin Squares, Mariam Abu-Adas

Scripps Senior Theses

In this thesis, we analyze various types of Latin squares, their solvability and embeddings. We examine the results by M. Hall, P. Hall, Ryser and Evans first, and apply our understandings to develop an algorithm that the determines the minimum possible embedding of an unsolvable Latin square. We also study Latin squares with missing diagonals in detail.