A lower bound on minimal number of colors for links
| Autor: | Ichihara, Kazuhiro, Matsudo, Eri |
|---|---|
| Rok vydání: | 2015 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | We show that the minimal number of colors for all effective $n$-colorings of a link with non-zero determinant is at least $1+\log_2 n$. Comment: 7 pages |
| Databáze: | arXiv |
| Externí odkaz: |
|