On the Error Bound in a Combinatorial Central Limit Theorem

A combinatorial central limit theorem with a third-moment error bound is proved. Our approach is by Stein's method of exchangeable pairs and the use of a concentration inequality.