A Note on Altermatic Number
classification
🧮 math.CO
keywords
numberaltermaticcombinatorialnoteauthorsborsuk-boundchromatic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.