Color spectra and coloring conjectures
نویسنده
چکیده
In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on the features of modular arithmetic. We introduce a sequence of transformations on colored diagrams called Teneva Transformations. Each of these Transformations reduces the number of colors in the diagrams by one (up to a point). This allows us to further decrease the upper bounds on these minima. We conjecture on the value of these minima. We apply these Transformations to rational knots.
منابع مشابه
A Unified Spiral Chain Coloring Algorithm for Planar Graphs
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this context respectively, are vertex, edge, total and entire colorings of the planar graphs. The main tool in the coloring algorithm is the use of spiral chain which has been used in the non-computer proof of the four color theorem in 2004. A more precies explanation of t...
متن کاملOn the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs, and assume that a coloring for a graph with the minimum possible number of colors will result in the most compressible representation. In this paper we show that this assumption is wrong. We show that there exist gra...
متن کاملRecognizable colorings of cycles and trees
For a graph G and a vertex-coloring c : V (G) → {1, 2, . . . , k}, the color code of a vertex v is the (k + 1)-tuple (a0, a1, . . . , ak), where a0 = c(v), and for 1 ≤ i ≤ k, ai is the number of neighbors of v colored i. A recognizable coloring is a coloring such that distinct vertices have distinct color codes. The recognition number of a graph is the minimum k for which G has a recognizable k...
متن کاملReduction of 4-methylimidazole in caramel coloring by ɣ-irradiation
4-Methylimidazole (4-MEI) is a simple nitrogen-containing heterocyclic compound, and recently classified as group 2B by International Agency for Research on Cancer (IARC). Caramel coloring is widely applied food coloring in many food products including coffee, carbonated beverages, beer and wine. In present study, ɣ-irradiation was applied to Caramel Color III to reduce the level of 4-MEI witho...
متن کاملSpiral Chains: The Proofs of Tait’s and Tutte’s Three-Edge-Coloring Conjectures
In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a threeedge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the four-color conjecture at the end of the 19th century. We have also shown the applicability of our method to another well-known three edge-coloring conjecture on cub...
متن کامل