We use the theory of combinatorial species to count unlabelled bipartite graphs and bipartite blocks (nonseparable or 2-connected graphs). We start with bicolored graphs, which are bipartite graphs that are properly colored in two colors. The two-element group $\mathfrak{S}_2$ acts on these graphs by switching the colors, and connected bipartite graphs are orbits of connected bicolored graphs under this action. From first principles we compute the $\mathfrak{S}_2$-cycle index for bicolored graphs, an extension of the ordinary cycle index, introduced by Henderson, that incorporates the $\mathfrak{S}_2$-action. From this we can compute the $\mathfrak{S}_2$-cycle index for connected bicolored graphs, and then the ordinary cycle index for connected bipartite graphs. The cycle index for connected bipartite graphs allows us, by standard techniques, to count unlabeled bipartite graphs and bipartite blocks.
@article{10_37236_3254,
author = {Andrew Gainer-Dewar and Ira M. Gessel},
title = {Enumeration of bipartite graphs and bipartite blocks},
journal = {The electronic journal of combinatorics},
year = {2014},
volume = {21},
number = {2},
doi = {10.37236/3254},
zbl = {1300.05129},
url = {http://geodesic.mathdoc.fr/articles/10.37236/3254/}
}
TY - JOUR
AU - Andrew Gainer-Dewar
AU - Ira M. Gessel
TI - Enumeration of bipartite graphs and bipartite blocks
JO - The electronic journal of combinatorics
PY - 2014
VL - 21
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/3254/
DO - 10.37236/3254
ID - 10_37236_3254
ER -
%0 Journal Article
%A Andrew Gainer-Dewar
%A Ira M. Gessel
%T Enumeration of bipartite graphs and bipartite blocks
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/3254/
%R 10.37236/3254
%F 10_37236_3254
Andrew Gainer-Dewar; Ira M. Gessel. Enumeration of bipartite graphs and bipartite blocks. The electronic journal of combinatorics, Tome 21 (2014) no. 2. doi: 10.37236/3254
