Enumerative properties of Ferrrers graphs

Stephanie van Willigenburg

University of British Columbia

September 26,
4:15pm
refreshments at 3:45pm
2-338

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.


Speaker's Contact Info: steph(at-sign)math.ubc.ca


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on August 26, 2003 at 05:03 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.