arXiv:1507.04088 [math.GT]AbstractReferencesReviewsResources
A lower bound on minimal number of colors for links
Kazuhiro Ichihara, Eri Matsudo
Published 2015-07-15Version 1
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$.
Related articles: Most relevant | Search more
Quadrisecants give new lower bounds for the ropelength of a knot
arXiv:1801.04030 [math.GT] (Published 2018-01-12)
A lower bound for the double slice genus
arXiv:0905.4486 [math.GT] (Published 2009-05-27)
Minimal Numbers of Fox Colors and Quandle Cocycle Invariants of Knots