Related papers: Colored Morton-Franks-Williams inequalities
We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollob\'as, concerning colorings of $K_n$ where each color is well-represented. Let $\chi$ be a coloring of the edges of a complete graph on $n$…
We extend knot Floer homology to string links in D^{2} \times I and to d-based links in arbitrary three manifolds, without any hypothesis on the null-homology of the components. As for knot Floer homology we obtain a description of the…
We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be…
Alexander polynomial arises in the leading term of a semi-classical Melvin-Morton-Rozansky expansion of colored knot polynomials. In this work, following the opposite direction, we propose how to reconstruct colored HOMFLY-PT polynomials,…
A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…
Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…
Given two graphs $F$ and $G$, an $F$-WORM coloring of $G$ is an assignment of colors to its vertices in such a way that no $F$-subgraph of $G$ is monochromatic or rainbow. If $G$ has at least one such coloring, then it is called $F$-WORM…
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks…
For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours…
Obtaining a closed-form expression for the colored HOMFLY-PT polynomials of knots from $3$-strand braids carrying arbitrary $SU(N)$ representation is a challenging problem. In this paper, we confine our interest to twisted generalized…
We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…
We conjecture the existence of four independent gradings in the colored HOMFLY homology. We describe these gradings explicitly for the rectangular colored homology of torus knots and make qualitative predictions of various interesting…
The main result of this paper is the introduction of marked graphs and the marked graph polynomials ($M$-polynomial) associated with them. These polynomials can be defined via a deletion-contraction operation. These polynomials are a…
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…
In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…
We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
Obtaining colored HOMFLY-PT polynomials for knots from 3-strand braid carrying arbitrary $SU(N)$ representation is still tedious. For a class of rank $r$ symmetric representations, $[r]$-colored HOMFLY-PT $H_{[r]}$ evaluation becomes…
In 1983, Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and that for every spatial complete graph on seven vertices, the…