Transversal (combinatorics)
Set that intersects every one of a family of sets / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Transversal (combinatorics)?
Summarize this article for a 10 year old
In mathematics, particularly in combinatorics, given a family of sets, here called a collection C, a transversal (also called a cross-section[1][2][3]) is a set containing exactly one element from each member of the collection. When the sets of the collection are mutually disjoint, each element of the transversal corresponds to exactly one member of C (the set it is a member of). If the original sets are not disjoint, there are two possibilities for the definition of a transversal:
- 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. In this case, the transversal is also called a system of distinct representatives (SDR).[4]: 29
- The other, less commonly used, does not require a one-to-one relation between the elements of the transversal and the sets of C. In this situation, the members of the system of representatives are not necessarily distinct.[5]: 692 [6]: 322
In computer science, computing transversals is useful in several application domains, with the input family of sets often being described as a hypergraph.