A simple proof on the number of $(3\times n)$-Latin rectangles based on a set of $\lambda$ elements

Pantaree Thengarnanchai, Pawaton Kaemawichanurat, Watcharintorn Ruksasakchai +1

In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of $(3\times n)$-Latin rectangles whose entries based on a set $\{1,2,...,\lambda \}$ in which $\lambda \ge n$.…