“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 15374 |
|
| Abstract: | |
|
In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for coind(B_0(ðº))+1 and coind(B(ðº)) + 2, the two classic topological lower bounds for the chromatic number of a graph ðº.
Download TeX format |
|
| back to top | |
