Smallest critical set and number of solutions for latin squares and Sudoku

Specialeforsvar ved Niklas Hjuler

Titel: Smallest critical set and number of soultions for latin squares and Sudoku

Abstract: This thesis works with smallest critical sets and number of solutions for Latin squares and Sudoku. Furthermore there will be focus on the relation of these two problems, specially a conjecture given by Mcguire. This conjecture will be rejected for Latin squares of size greater than 12 and its affect on the asymptotic growth of the number of Sudoku solutions will be discussed.

Vejleder :  Søren Eilers
Censor:      Lars Døvling Andersen, Aalborg Universitet