k-強制臨界集的大小

Abstract

臨界集是一個極小 ( minimal ) 的部份拉丁方陣，使得存在拉丁方陣可以包含此臨界集，且此方陣是唯一的。臨界集的大小是指此臨界集中已填位置的個數。在本篇論文中，首先我們將介紹 k-強制臨界集的概念，然後研究此類臨界集的大小。

A critical set is a minimal uniquely completable partial latin square. The size of a critical set is the number of filled cells within it. In this thesis, we first introduce the notion of k-forced critical sets and then study the size of such critical sets.