The dimensions and Euler characteristics of M. Kontsevich's graph complexes
Abstract
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.
 Publication:

arXiv eprints
 Pub Date:
 January 2014
 arXiv:
 arXiv:1401.4974
 Bibcode:
 2014arXiv1401.4974W
 Keywords:

 Mathematics  Quantum Algebra;
 Mathematics  Combinatorics
 EPrint:
 Adv. Math. 272 (2015), 553578