Rhyming schemes: Crossings and coverings
Some recent results on the enumeration of relations on finite totally ordered sets are unified by establishing correspondences between these relations and some types of rhyming scheme which are characterized by the planarity of certain graphical representations. These representations themselves and a systematic method of enumeration involving them are sketched. Interpretations and proofs of a number of combinatorial identities are obtained.