Bijective Proofs for "Enumerative Properties of Ferrers Graphs"

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of spanning trees and (where applicable) Hamiltonian paths of these graphs. Their paper can be found at http://www.ms.uky.edu/~jrge/Papers/Ferrers_graphs.pdf .
6 pages, 5 figures

Keywords

Combinatorics, 05C30

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/69602

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0312282
 http://arxiv.org/abs/math/0312282

Collections

arXiv