A lower bound on minimal number of colors for links
Abstract
We show that the minimal number of colors for all effective n-colorings of a link with non-zero determinant is at least 1+2 n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.