Related papers: The chromatic polynomial of fatgraphs and its cate…
The study of Feynman rules is much facilitated by the two Symanzik polynomials, homogeneous polynomials based on edge variables for a given Feynman graph. We review here the role of a recently discovered third graph polynomial based on…
It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…
We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow-up work of Bernshteyn) on the (list) chromatic number of triangle-free graphs. In both our results, we permit the amount of colour made…
The chromatic functor of a simple graph is a functorization of the chromatic polynomial. M. Yoshinaga showed in \cite{Yoshinaga2015} that two finite graphs have isomorphic chromatic functors if and only if they have the same chromatic…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
We define Khovanov homology mod 2 for graph-links.
We study a model of random graph where vertices are $n$ i.i.d. uniform random points on the unit sphere $S^d$ in $\mathbb{R}^{d+1}$, and a pair of vertices is connected if the Euclidean distance between them is at least $2- \epsilon$. We…
This paper contains a proof that chromatic weight systems, introduced by Chmutov, Duzhin and Lando, can be expressed in terms of weight systems associated with direct sums of the Lie algebras gl_n and so_n. As a consequence the Vassiliev…
We introduce a refinement of Bar-Natan homology for involutive links, extending the work of Lobb-Watson and Sano. We construct a new suite of numerical invariants and derive bounds for the genus of equivariant cobordisms between strongly…
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…
Recently, big data techniques such as machine learning and topological data analysis have made their way to theoretical mathematics. Motivated by the recent work with polynomial invariants for knots, we use manifold learning and topological…
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at…
We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
Motivated by a possible connection between the $\mathrm{SU}(N)$ instanton knot Floer homology of Kronheimer and Mrowka and $\mathfrak{sl}(N)$ Khovanov-Rozansky homology, Lobb and Zentner recently introduced a moduli problem associated to…
We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that…
We prove that two horizontal-strip LLT polynomials are equal if the associated weighted graphs defined by the author in a previous paper are isomorphic. This provides a sufficient condition for equality of horizontal-strip LLT polynomials…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…
We revisit Rozansky's construction of Khovanov homology for links in $S^2\times S^1$, extending it to define Khovanov homology $Kh(L)$ for links $L$ in $M^r=#^r(S^2\times S^1)$ for any $r$. The graded Euler characteristic of $Kh(L)$ can be…