MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES

DOI10.1142/S0218216511009728zbMath1241.57019arXiv1001.1334OpenAlexW2962910877MaRDI QIDQ3224942

Pedro Lopes, João L. H. Matias

Publication date: 13 March 2012

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.1334

zbMATH Keywords

determinantcoloring

Mathematics Subject Classification ID

Related Items (12)

Answer to a question by Nakamura, Nakanishi, and Satoh involving crossing numbers of knots ⋮ Any 11-Colorable knot can be colored with at most six colors ⋮ Minimal sufficient sets of colors and minimum number of colors ⋮ The palette numbers of torus knots ⋮ The delunification process and minimal diagrams ⋮ THE TENEVA GAME ⋮ The 6- and 8-palette numbers of links ⋮ ON THE MAXIMUM NUMBER OF COLORS FOR LINKS ⋮ On effective 9-colorings for knots ⋮ The minimum number of Fox colors modulo 13 is 5 ⋮ 11-Colored knot diagram with five colors ⋮ The minimization of the number of colors is different at p = 11

Cites Work

• A proof of the Kauffman-Harary conjecture
• Knots and graphs. I: Arc graphs and colorings
• On the minimum number of colors for knots
• THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS
• QUANDLES AT FINITE TEMPERATURES I
• Any 7-colorable knot can be colored by four colors

This page was built for publication: MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES