# The Dinitz problem

I would like to ask if someone knows about good books or online articles about The Dinitz problem or maybe someone can explain the problem a little.

Consider $n^2$ cells arranged in an $( n \times n)$-square, and let $(i,j)$ denote the cell in row $i$ and columns $j$. Suppose that for every cell $(i,j)$ we are given a set $C(i,j)$ of $n$ colors.
Is it then always possible to color the whole array by picking for each cell $(i,j)$ a coor from its set $C(i,j)$ such that the colors in each row and each column are distinct?