The dimensions and Euler characteristics of M. Kontsevich's graph complexes

Research paper by Thomas Willwacher, Marko Živković

Indexed on: 05 Mar '14Published on: 05 Mar '14Published in: Mathematics - Quantum Algebra


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 graphs with multiple edges can be omitted from these graph complexes.