MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What would be the closed-form expression defining number of all possible labelled connected bipartite graphs given $\mid X \mid = m, \mid Y \mid = n - m $?

share|cite|improve this question
up vote 2 down vote accepted

The number of connected labeled bipartite graphs with bipartition $(X,Y)$ where $|X|=m$ and $|Y|=n$ is the coefficient of $x^my^n/m!\,n!$ in $$\log\biggl(\sum_{m,n=0}^\infty 2^{mn} \frac{x^m}{m!}\frac{y^n}{n!}\biggr).$$ They are sequence A123260 in the OEIS.

share|cite|improve this answer

Found the answer in Labeled Bipartite Blocks by F. Harary and R. W. Robinson ( , page 63, formula 11):

$$C(m, n) = 2^{nm} - \sum{* \binom{n - 1}{a - 1} \binom{m}{b} 2^{(n - a)(m - b)} C(a, b) }.$$

The asterisk on the summation indicates conditions $1 \leq a \leq n$, $0 \leq b \leq m$, and either $a < n$ or $b < m$. The initial conditions are $R(0, 1) = 1$ and $R(0, n) = 0$ for $n \ne 1$, and it is obvious that $R(m, n) = R(n, m)$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.