Related papers: The triconnected Kontsevich graph complex
We prove that if $H$ is a subgraph of a complete multipartite graph $G$, then $H$ contains a connected component $H'$ satisfying $|E(H')||E(G)|\geq |E(H)|^2$. We use this to prove that every three-coloring of the edges of a complete graph…
We relate graph complexes, Calabi-Yau $A_\infty$-categories and Kontsevich's cocycle construction. Our main result produces a commutative square of shifted Poisson algebras; one of its edges is the Loday-Quillen-Tsygan map, generalized to…
We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…
We study geometric and topological properties of infinite graphs that are quasi-isometric to a planar graph of bounded degree. We prove that every locally finite quasi-transitive graph excluding a minor is quasi-isometric to a planar graph…
On a flat manifold, M. Kontsevich's formality quasi-isomorphism is compatible with cup-products on tangent cohomology spaces, in the sense that its derivative at any formal Poisson 2-tensor induces an isomorphism of graded commutative…
Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…
We compute the Kontsevich graph cohomology in loop order 11, and for some degrees in higher loop order. We apply our results to discuss a conjecture of F. Brown, providing a counterexample to a strong version of the conjecture.
Given a directed graph G=(V,E) an independent set A of the vertices V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point of A to v (from v to some point of A). Every finite directed…
A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small…
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$ are {\it isomorphic up to complementation} if $G'$ is isomorphic to $G$ or to the complement $\bar G$ of $G$. Let $k$ be a non-negative…
The dual Kontsevich cycles in the double dual of associative graph homology correspond to polynomials in the Miller-Morita-Mumford classes in the integral cohomology of mapping class groups. I explain how the coefficients of these…
A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
This paper explores a particular statistical model on 6-valent graphs with special properties which turns out to be invariant with respect to certain Roseman moves if the graph is the singular point graph of a diagram of a 2-knot. The…
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have attained a lot of attention from both the structural and…
We consider {\em L-graphs}, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing connections to Schnyder realizers and canonical orders of…
In this note, we prove the existence of a tri-graded Khovanov-type bicomplex (Theorem 1.2). The graded Euler characteristic of the total complex associated with this bicomplex is the colored Jones polynomial of a link. The first grading of…
We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of…
We produce a new, shorter construction of a minor-universal planar graph.
We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.