Related papers: Graphs on surfaces and Khovanov homology
We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow's homological definition of the Jones polynomial and Kauffman's definition of the Jones polynomial.…
We give an excluded minor characterisation of the class of ribbon graphs that admit partial duals of Euler genus at most one.
It is well known that there is a bijective correspondence between metric ribbon graphs and compact Riemann surfaces with meromorphic Strebel differentials. In this article, it is proved that Grothendieck's correspondence between dessins…
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…
Khovanov homology is a recently introduced invariant of oriented links in $\mathbb{R}^3$. It categorifies the Jones polynomial in the sense that the (graded) Euler characteristic of the Khovanov homology is a version of the Jones polynomial…
It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a linear ordering on their vertex set, and the…
Khovanov homology, an invariant of links in $\mathbb{R}^3$, is a graded homology theory that categorifies the Jones polynomial in the sense that the graded Euler characteristic of the homology is the Jones polynomial. Asaeda, Przytycki and…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
Orthologous genes, which arise through speciation, play a key role in comparative genomics and functional inference. In particular, graph-based methods allow for the inference of orthology estimates without prior knowledge of the underlying…
An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue)…
A string graph is the intersection graph of curves in the plane. Kratochv\'il previously showed the existence of infinitely many obstacles: graphs that are not string graphs but for which any edge contraction or vertex deletion produces a…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be shrunk to a tree on the same vertex set. Klimo\v{s}ov\'{a}…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…
In this note we show that any embedded graph has a checkerboard colourable twisted dual and any Eulerian embedded graph has a checkerboard colourable partial Petrial, answering questions posed by Ellis-Monaghan and Moffatt. The proofs are…
The conormal lift of a link $K$ in $\R^3$ is a Legendrian submanifold $\Lambda_K$ in the unit cotangent bundle $U^* \R^3$ of $\R^3$ with contact structure equal to the kernel of the Liouville form. Knot contact homology, a topological link…
The Sombor index $SO(G)$ of a graph $G$ is the sum of the edge weights $\sqrt{d^2_G(u)+d^2_G(v)}$ of all edges $uv$ of $G$, where $d_G(u)$ denotes the degree of the vertex $u$ in $G$. A connected graph $G = (V ,E)$ is called a quasi-tree,…
We construct a direct quasi-isomorphism from Kontsevich's graph complex GC_n to the oriented graph complex OGC_{n+1}, thus providing an alternative proof that the two complexes are quasi-isomorphic. Moreover, the result is extended to the…
For an integer k >= 1, the k-th interlacing adjoint of a digraph G is the digraph i_k(G) with vertex-set V(G)^k, and arcs ((u_1, ..., u_k), (v_1, ..., v_k)) such that (u_i,v_i) \in A(G) for i = 1, ..., k and (v_i, u_{i+1}) \in A(G) for i =…