Related papers: Three dimensions of knot coloring

It is well known that any set of n intervals in $\mathbb{R}^1$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more…

We obtain the following new coloring results: * A 3-colorable graph on $n$ vertices with maximum degree~$\Delta$ can be colored, in polynomial time, using $O((\Delta \log\Delta)^{1/3} \cdot\log{n})$ colors. This slightly improves an…

We point out that the strong slope conjecture implies that the degrees of the colored Jones knot polynomials detect the figure eight knot. Furthermore, we propose a characterization of alternating knots in terms of the Jones period and the…

We present a set of 26 finite quandles that distinguish (up to reversal and mirror image) by number of colorings, all of the 2977 prime oriented knots with up to 12 crossings. We also show that 1058 of these knots can be distinguished from…

Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…

It is known that the Alexander polynomial detects fibered knots and 3-manifolds that fiber over the circle. In this note, we show that when the Alexander polynomial becomes inconclusive, the notion of "knot adjacency", studied in the paper…

The homset invariant of a knot or link L with respect to an algebraic knot coloring structure X can be identified with a set of colorings of a diagram of L by elements of X via an identification of diagrammatic generators with algebraic…

The minimum number of colors is a challenging knot invariant since, by definition, its calculation requires taking the minimum over infinitely many minima. In this article we estimate and in some cases calculate the minimum number of colors…

Following problems posed by Gy\'arf\'as, we show that for every $r$-edge-colouring of $K_n$ there is a monochromatic triple star of order at least $n/(r-1)$, improving a previous result by Ruszink\'o. An edge colouring of a graph is called…

An \"{u}bercrossing diagram is a knot diagram with only one crossing that may involve more than two strands of the knot. Such a diagram without any nested loops is called a petal projection. Every knot has a petal projection from which the…

Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual links: the cut point number. Checkerboard framings and cut…

A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…

Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…

The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…

Knot theory is the Mathematical study of knots. In this paper we have studied the Composition of two knots. Knot theory belongs to Mathematical field of Topology, where the topological concepts such as topological spaces, homeomorphisms,…

A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…

We consider the problem of counting the number of 3-colourings of the edges (bonds) of the 4-8 lattice and the 3-12 lattice. These lattices are Archimedean with coordination number 3, and can be regarded as decorated versions of the square…

Quandle coloring quivers are directed graph-valued invariants of oriented knots and links, defined using a choice of finite quandle $X$ and set $S\subset\mathrm{Hom}(X,X)$ of endomorphisms. From a quandle coloring quiver, a polynomial knot…

Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges,…

From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for…