Paths in ordered structures of partitions

Ordered structures of partitions are obtained by removing nodes from Ferrers diagrams in certain prescribed ways. Results connecting paths between two elements in such a structure and irreducible characters of symmetric groups are obtained.