“…Examples of this construction for known graph cocycles γ 2ℓ+1 on n vertices and 2n − 2 edges (namely, n = 2ℓ + 2 = 4, 6, and 8) have been given in [2,3], [7], and [4], respectively. Practical calculation of graph cocycles is addressed in [8,30]; the algorithms to verify the Poisson cocycle factorisation through the Jacobi identity are available from [9]. In the fundamental work [29], see also [27], Willwacher related the unoriented graph complex to generators of the Grothendieck-Teichmüller Lie algebra grt.…”