Transversal (combinatorics)

This is an old revision of this page, as edited by Ott2 (talk | contribs) at 16:50, 4 June 2007 (rephrase for clarity). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Given a collection C of disjoint sets, a transversal is a set containing exactly one element from each member of the collection. If the original sets are not disjoint, there are several different definitions. One variation is that there is a bijection f from the transversal to C such that x is an element of f(x) for each x in the transversal. A less restrictive definition requires that the transversal just has a non-empty intersection with each member of C.

As an example of the disjoint-sets meaning of transversal, in group theory, given a subgroup H of a group G, a right (respectively left) transversal is a set containing exactly one element from each right (respectively left) coset of H.

Reference

  • Mirsky, Leon (1971). Transversal Theory: An account of some aspects of combinatorial mathematics. Academic Press. ISBN 0-12-498550-5.