### Abstract

In this paper we provide an explicit formula for calculating the boolean number of a Ferrers graph. By previous work of the last two authors, this determines the homotopy type of the boolean complex of the graph. Specializing to staircase shapes, we show that the boolean numbers of the associated Ferrers graphs are the Genocchi numbers of the second kind, and obtain a relation between the Legendre-Stirling numbers and the Genocchi numbers of the second kind. In another application, we compute the boolean number of a complete bipartite graph, corresponding to a rectangular Ferrers shape, which is expressed in terms of the Stirling numbers of the second kind. Finally, we analyze the complexity of calculating the boolean number of a Ferrers graph using these results and show that it is a significant improvement over calculating by edge recursion.

Original language | English |
---|---|

Pages (from-to) | 159-173 |

Number of pages | 15 |

Journal | Australasian Journal of Combinatorics |

Volume | 48 |

Publication status | Published - Oct 2010 |

### Keywords

- Ferrers graph
- boolean complex
- bipartite graphs

## Cite this

Claesson, A., Kitaev, S., Ragnarsson, K., & Tenner, B. E. (2010). Boolean complexes for Ferrers graphs.

*Australasian Journal of Combinatorics*,*48*, 159-173.