A Generalization of Gale's lemma
classification
🧮 math.CO
keywords
generalizationboundsconidgalelemmalowerchromaticcombinatorial
read the original abstract
In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two combinatorial sharp lower bounds for ${\rm conid}({\rm B}_0(G))+1$ and ${\rm conid}({\rm B}(G))+2$, two famous topological lower bounds for the chromatic number of a graph $G$.
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.