  In view of Tucker's lemma (an equivalent combinatorial version of the Borsuk-
Ulam theorem), the present authors (2013) introduced the kth altermatic number
of a graph G as a tight lower bound for the chromatic number of G. In this
note, we present a purely combinatorial proof for this result.
