Related papers: A proof of the Kauffman-Harary Conjecture

For a reduced alternating diagram of a knot with a prime determinant $p,$ the Kauffman-Harary conjecture states that every non-trivial Fox $p$-coloring of the knot assigns different colors to its arcs. In this paper, we prove a…

The Kauffman-Harary conjecture states that for any reduced alternating diagram K of a knot with a prime determinant p, every non-trivial Fox p-coloring of K assigns different colors to its arcs. We generalize the conjecture by stating it in…

In 1999, Kauffman-Harary conjectured that every non-trivial Fox $p$-coloring of a reduced, alternating knot diagram with prime determinant $p$ is heterogeneous. Ten years later this conjecture was proved by W. Mattman and P. Solis. Mathew…

This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…

Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…

The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976…

This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…

We propose a new, precise integrality conjecture for the colored Kauffman polynomial of knots and links inspired by large N dualities and the structure of topological string theory on orientifolds. According to this conjecture, the natural…

We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras…

In 1967 Herbert Scarf suggested a new proof of Brouwer fixed point theorem based on a surprising analogue of Sperner's lemma. This analogue was motivated by Scarf's work in game theory and mathematical economics. Moreover, Scarf proved a…

In this paper, we propose and discuss implications of a general conjecture that there is a canonical action of a rank 1 double affine Hecke algebra on the Kauffman bracket skein module of the complement of a knot $K \subset S^3$. We prove…

We study the structural properties of colored Kauffman homologies of knots. Quadruple-gradings play an essential role in revealing the differential structure of colored Kauffman homology. Using the differential structure, the Kauffman…

We discuss two realizations of the colored Jones polynomials of a knot, one from an unnoticed work of the second author in 1994 on quantum R-matrices at roots of unity obtained from solutions of the pentagon identity, and another one from…

Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship…

A Fox p-colored knot $K$ in $S^3$ gives rise to a $p$-fold branched cover $M$ of $S^3$ along $K$. The pre-image of the knot $K$ under the covering map is a $\dfrac{p+1}{2}$-component link $L$ in $M$, and the set of pairwise linking numbers…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the…

Given a graph property $\mathcal{P}$, F. Harary introduced in 1985 $\mathcal{P}$-colorings, graph colorings where each colorclass induces a graph in $\mathcal{P}$. Let $\chi_{\mathcal{P}}(G;k)$ counts the number of $\mathcal{P}$-colorings…

The Kneser conjecture (1955) was proved by Lov\'asz (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions.…