Related papers: The oriented graph complexes
Universal solutions to deformation quantization problems can be conveniently classified by the cohomology of suitable graph complexes. In particular, the deformation quantizations of (finite-dimensional) Poisson manifolds and Lie bialgebras…
We prove that the action of the Grothendieck-Teichm\"uller group on the genus completed properad of (homotopy) Lie bialgebras commutes with the reversing directions involution of the latter. We also prove that every universal quantization…
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if $F_k$ is the set of homomorphic images of the directed path on $k+1$ vertices, then a…
Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\gamma$ be endowed with an ordered set of edges…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
We prove that the Kontsevich graph complex $GC_d^{2}$ and its oriented version $OGC_{d+1}^2$ are quasi-isomorphic as dg Lie algebras.
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
We compute the homotopy derivations of the properads governing even and odd Lie bialgebras as well as involutive Lie bialgebras. The answer may be expressed in terms of the Kontsevich graph complexes. In particular, this shows that the…
An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph $G$ of sufficiently large order $n$ with $\mathrm{deg}^+(x) +\mathrm{deg}^{-}(y)\geq…
We give a presentation in terms of generators and relations of the cohomology in degree zero of the Campos-Willwacher graph complexes associated to compact orientable surfaces of genus $g$. The results carry a natural Lie algebra structure,…
We study the deformation complex of a canonical morphism $i$ from the properad of (degree shifted) Lie bialgebras $\mathbf{Lieb}_{c,d}$ to its polydifferential version $\mathcal{D}(\mathbf{Lieb}_{c,d})$ and show that it is quasi-isomorphic…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…
It is well-known that the Lie algebra of homotopy non-trivial degree zero derivations of the properad of strongly homotopy Lie bialgebras $\mathcal{H}olieb$ can be identified with the Grothendieck-Teichmuller Lie algebra $\mathfrak{grt}$.…
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
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…
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex. Klostermeyer and MacGillivray defined push graphs which are…
We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…
Quasi-Lie bialgebras are natural extensions of Lie-bialgebras, where the cobracket satisfies the co-Jacobi relation up to some natural obstruction controlled by a skew-symmetric 3-tensor $\phi$. This structure was introduced by Drinfeld…
Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient…