Juanjo Rué

Applications of Tutte's tree decomposition in the enumeration of bipartite graph families


We adapt the grammar introduced by Chapuy, Fusy, Kang and Shoilekova to study bipartite graph families which are defined by their 3-connected components. More precisely, in this talk I will explain how to get the counting formulas for bipartite series-parallel graphs (and more generally of the Ising model over this family of graphs), as well as asymptotic estimates for the number of such graphs with a fixed size.

This talk is based in a work in progress joint with Kerstin Weller.