Short Proof of a Conjecture on the Tr-Choice Number of Even Cycles

摘要

In this note we prove that the Tau-choice number of the cycle C2n is equal to the Tau-choice number of the path (tree) on 4n-1 vertices, i.e. Tau-ch (C2n)=(2r+2). This solves a recent conjecture of Alon and Zaks.