Transversal (combinatorics): Difference between revisions

Revision as of 16:50, 4 June 2007

Revision as of 18:18, 14 June 2007

Line 1:

{{otheruses}}

GivenIn [[combinatorics|combinatorial]] mathematics, given a collection ''C'' of disjoint [[set theory|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'',