Bijective Proofs for "Enumerative Properties of Ferrers Graphs"

Details Bijective Proofs for "Enumerative Properties of Ferrers Graphs" Bijective Proofs for "Enumerative Properties of Ferrers Graphs"

2003-12-15

arxiv.org/abs/math/0312282v1

Mathematics

Combinatorics

6 pages, 5 figures

Scientific paper

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 .

Affiliated with

Also associated with

No associations

Rating

Bijective Proofs for "Enumerative Properties of Ferrers Graphs" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bijective Proofs for "Enumerative Properties of Ferrers Graphs", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijective Proofs for "Enumerative Properties of Ferrers Graphs" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102544