A generalization of Gale's lemma
Meysam Alishahi, Hossein Hajiabolhassan · Journal of Graph Theory · 2017
Abstract In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for and , the two classic topological lower bounds for the chromatic number of a graph G .