A Generalization of Gale's lemma
Combinatorics
2016-08-01 v1
Abstract
In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two combinatorial sharp lower bounds for and , two famous topological lower bounds for the chromatic number of a graph .
Cite
@article{arxiv.1607.08780,
title = {A Generalization of Gale's lemma},
author = {Meysam Alishahi and Hossein Hajiabolhassan},
journal= {arXiv preprint arXiv:1607.08780},
year = {2016}
}