Transversal (combinatorics): Difference between revisions

Revision as of 22:46, 23 July 2009

Revision as of 22:28, 4 October 2009

Line 1:

{{otherusesOtheruses}}

{{contextContext|date=September 2008}}

In [[combinatorics|combinatorial]] mathematics, given a collection ''C'' of [[set theory|sets]], a '''transversal''' is a set containing exactly one element from each member of the collection: it is a [[Section (category theory)|section]] of the [[quotient map]] induced by 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''.

Line 18:

[[Category:Combinatorics]]

[[Category:Group theory]]

{{Combin-stub}}