Bijective Proofs for "Enumerative Properties of Ferrers Graphs"

Simple item page
dc.creatorBurns, Jason
dc.date2003-12-15
dc.date.accessioned2026-07-07T05:03:55Z
dc.date.available2026-07-07T05:03:55Z
dc.descriptionRecently, 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 .
dc.description6 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/math/0312282
dc.identifierhttp://arxiv.org/abs/math/0312282
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69602
dc.subjectCombinatorics
dc.subject05C30
dc.titleBijective Proofs for "Enumerative Properties of Ferrers Graphs"
dc.typetext

Files

Collections

arXiv