Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

The palette numbers of torus knots

    https://doi.org/10.1142/S0218216517500602Cited by:0 (Source: Crossref)

    For an effectively n-colorable knot K, the palette number Cn(K) is the minimum number of distinct colors for all effective n-colorings of K. It is known that Cn(K)2+log2n for any effectively n-colorable knot K. In this paper, we show that for any odd n3 and effectively n-colorable torus knot K it holds that Cn(K)=2+log2n namely, any effectively n-colorable torus knot has an effectively n-colored diagram with 2+log2n colors.

    AMSC: 57M25