Bijective Proofs for "Enumerative Properties of Ferrers Graphs"
Abstract
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/Ferrersgraphs.pdf .
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.