A Note on Altermatic Number
Combinatorics
2015-10-26 v1
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.
Keywords
Cite
@article{arxiv.1510.06932,
title = {A Note on Altermatic Number},
author = {Meysam Alishahi and Hossein Hajiabolhassan},
journal= {arXiv preprint arXiv:1510.06932},
year = {2015}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1407.8035