A Note on Altermatic Number
arXiv:1510.06932
Abstract
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.
arXiv admin note: substantial text overlap with arXiv:1407.8035