Enumerative properties of Ferrrers graphsStephanie van WilligenburgUniversity of British Columbia
September 26,

ABSTRACT


Abstract: For every Ferrers diagram one can construct a bipartite graph in a natural way. In this talk we introduce these graphs and calculate the number of spanning trees, the number of Hamiltonian paths, and the chromatic polynomial of such a graph. In particular, it transpires that formulas for the former two have simple combinatorial descriptions, whilst the latter is related to a set of permutations that satisfy certain criteria. This is joint work with Richard Ehrenborg. 
Combinatorics Seminar, Mathematics Department, MIT, sara(atsign)math.mit.edu 

