Vol. 10, No. 2, 2017

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 4, 543–722
Issue 3, 363–541
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
Fox coloring and the minimum number of colors

Mohamed Elhamdadi and Jeremy Kerr

Vol. 10 (2017), No. 2, 291–316
Abstract

We study Fox colorings of knots that are 13-colorable. We prove that any 13-colorable knot has a diagram that uses exactly five of the thirteen colors that are assigned to the arcs of the diagram. Due to an existing lower bound, this gives that the minimum number of colors of any 13-colorable knot is 5.

Keywords
knots, fox colorings, minimum number of colors
Mathematical Subject Classification 2010
Primary: 57M25
Milestones
Received: 29 September 2015
Revised: 5 January 2016
Accepted: 24 January 2016
Published: 10 November 2016

Communicated by Kenneth S. Berenhaut
Authors
Mohamed Elhamdadi
Mathematics Department
University of South Florida
Tampa, FL 33620
United States
Jeremy Kerr
Mathematics Department
University of South Florida
Tampa, FL 33620
United States