Related papers: The Generalized Kauffman-Harary Conjecture is True

The cosmetic crossing conjecture posits that switching a non-trivial crossing in a knot diagram always changes the knot type. Generalizing work of Balm, Friedl, Kalfagianni and Powell, and of Lidman and Moore, we give an Alexander…

Using elementary equalities between various cables of the unknot and the Hopf link, we prove the Wheels and Wheeling conjectures of [Bar-Natan, Garoufalidis, Rozansky and Thurston, arXiv:q-alg/9703025] and [Deligne, letter to Bar-Natan,…

Albertson conjectured that every graph with chromatic number $r$ has crossing number at least the crossing number of the complete graph $K_r$. This conjecture was proved for $r\le 12$ by Albertson, Cranston, and Fox; for $r\le 16$ by…

We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…

Hadwiger's famous coloring conjecture states that every $t$-chromatic graph contains a $K_t$-minor. Holroyd [Bull. London Math. Soc. 29, (1997), pp. 139--144] conjectured the following strengthening of Hadwiger's conjecture: If $G$ is a…

From analysis of a big variety of different knots we conclude that at q which is an root of unity, q^{2m}=1, HOMFLY polynomials in symmetric representations [r] satisfy recursion identity: H_{r+m} = H_r H_m for any A, which is a…

Let $\mathsf{B}_1$ be the polynomial ring $\mathbb{C}[a^{\pm1},b]$ with the structure of a complex Hopf algebra induced from its interpretation as the algebra of regular functions on the affine linear algebraic group of complex invertible…

A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le…

A $\frac{1}{k}$-majority $l$-edge-colouring of a graph $G$ is a colouring of its edges with $l$ colours such that for every colour $i$ and each vertex $v$ of $G$, at most $\frac{1}{k}$'th of the edges incident with $v$ have colour $i$. We…

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…

Connection of the Four Color Theorem (FCT) with some operations on trees is described. L.H. Kauffman's theorem about FCT and vector cross product is discussed. Operation of transplantation on trees linked with the move of brackets according…

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares and has been the focus of extensive research ever since. Many…

In previous joint work with Frohman and Lofaro a noncommutative generalization of the A-polynomial of a knot was introduced, consisting of a finitely generated ideal of polynomials (the noncommutative A-ideal) in the quantum plane. The…

Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The…

We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta<\kappa$, the existence of a strongly unbounded coloring…

This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are…

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

The AJ Conjecture relates a quantum invariant, a minimal order recursion for the colored Jones polynomial of a knot (known as the $\hat{A}$ polynomial), with a classical invariant, namely the defining polynomial $A$ of the $\psl$ character…

Kostochka and Woodall (2001) conjectured that the square of every graph has the same chromatic number and list chromatic number. In 2015 Kim and Park disproved this conjecture for non-bipartite and bipartite graphs. It was asked by several…

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…