Related papers: On interrelations between graph complexes

We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…

Nambu-determinant brackets on $R^d\ni x=(x^1,...,x^d)$, $\{f,g\}_d(x)=\rho(x) \det(\partial(f,g,a_1,...,a_{d-2})/\partial(x^1,...,x^d))$, with $a_i\in C^\infty(R^d)$ and $\rho\partial_x\in\mathfrak{X}^d(R^d)$, are a class of Poisson…

Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…

For a vertex set $S\subseteq V(G)$ in a graph $G$, the {\em distance multiset}, $D(S)$, is the multiset of pairwise distances between vertices of $S$ in $G$. Two vertex sets are called {\em homometric} if their distance multisets are…

Huang proved that every set of more than half the vertices of the $d$-dimensional hypercube $Q_d$ induces a subgraph of maximum degree at least $\sqrt{d}$, which is tight by a result of Chung, F\"uredi, Graham, and Seymour. Huang asked…

We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy…

We introduce a norm on the real 1-cohomology of finite 2-complexes determined by the Euler characteristics of graphs on these complexes. We also introduce twisted Alexander-Fox polynomials of groups and show that they give rise to norms on…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…

Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…

This paper develops a new chain model for the commutative graph complex $\mathsf{GC}_2$ which takes Lie graph homology as an input. Our main technical result is the identification of a large contractible complex of (certain) tadpoles and…

This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…

We show that if $H$ is an almost normal subgroup of $G$ such that both $H$ and $G$ are of type $VFP$ and vcd($G$) = vcd($H$) + 1, then $G$ is the fundamental group of a graph of groups in which all vertex and edge groups are commensurable…

For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ is paired with a $2$-edge-colouring…

We prove an asymptotic formula for the Euler characteristic of Kontsevich's commutative graph complex. This formula implies that the total amount of commutative graph homology grows super-exponentially with the rank and, via a theorem of…

We study the deformation complex of the dg wheeled properad of $\mathbb{Z}$-graded quadratic Poisson structures and prove that it is quasi-isomorphic to the even M. Kontsevich graph complex. As a first application we show that the…

We give a uniform and self-contained proof that if $G$ is a connected graph with $\chi(G) = \Delta(G)$ and $G\neq \overline{C_7}$, then $G$ contains either $K_{\Delta(G)}$ or an odd hole where every vertex has degree at least $\Delta(G)-1$…

We study the space ${\mathcal X}^{d}(G)$ of pictures of a graph $G$ in complex projective $d$-space. The main result is that the homology groups (with integer coefficients) of ${\mathcal X}^{d}(G)$ are completely determined by the Tutte…

The aim of this paper is to present a generalization of Gr\"otzsch graph. Inspired by structure of the Gr\"otzsch's graph, we present constructions of two families of graphs, $G_m$ and $H_m$ for odd and even values of $m$ respectively and…

Let $B$ be an equivalence relation defined on a finite group $G$. The $B$ super commuting graph on $G$ is a graph whose vertex set is $G$ and two distinct vertices $g$ and $h$ are adjacent if either $[g] = [h]$ or there exist $g' \in [g]$…