Removing colors 2k, 2k − 1, and k

DOI10.1142/S0218216519400133zbMATH Open1439.57021arXiv1308.5278OpenAlexW2982508134MaRDI QIDQ5218909FDOQ5218909

Authors:

Publication date: 6 March 2020

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

Abstract: We prove that if a link admits non-trivial (2k+1)-colorings, with prime 2k+1>7, it also admits non-trivial (2k+1)-colorings not involving colors 2k, 2k-1, nor k.

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

Recommendations

• Colourful FKS subtraction
• \(k\)-resistant colorings
• Reducing the chromatic number by vertex or edge deletions
• 2-coloring number revisited
• Colorings of the Graph K ᵐ 2 + Kn
• Solving some instances of the 2-color problem
• Avoiding colored partitions of two elements in the pattern sense
• Partitioning into colorful components by minimum edge deletions

zbMATH Keywords

knots and linksminimum number of colorsFox coloringsremoving colors

Mathematics Subject Classification ID

Knot theory (57K10)

Cites Work

• Title not available (Why is that?)
• Knots and graphs. I: Arc graphs and colorings
• On the minimum number of colors for knots
• QUANDLES AT FINITE TEMPERATURES I
• The delunification process and minimal diagrams
• Any 7-colorable knot can be colored by four colors
• 5-colored knot diagram with four colors
• 11-colored knot diagram with five colors
• The pallet graph of a Fox coloring
• The minimum number of Fox colors modulo 13 is 5
• Any 11-Colorable knot can be colored with at most six colors
• On the maximum number of colors for links

Cited In (4)

• Knots with Composite Colors
• MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
• The palette numbers of torus knots
• The minimum number of coloring of knots

This page was built for publication: Removing colors 2k, 2k − 1, and k

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218909)