2 research outputs found
A generalization of Gale's lemma
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