In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of $(3 \times n)$-Latin rectangles whose entries based on a set $\{1, 2, ..., λ\}$ in which $λ\geq n$. Their proof requires Möbius inversion formula and lattice partitions. In this paper, we present a simpler proof by using the idea of mathematical induction and appropriate coloring.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。