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:

In computer science, computing transversals is useful in several application domains, with the input family of sets often being described as a hypergraph.

Existence and number

A fundamental question in the study of SDR is whether or not an SDR exists. Hall's marriage theorem gives necessary and sufficient conditions for a finite collection of sets, some possibly overlapping, to have a transversal. The condition is that, for every integer k, every collection of k sets must contain in common at least k different elements.[4]: 29 

The following refinement by H. J. Ryser gives lower bounds on the number of such SDRs.[7]: 48 

Theorem. Let S1, S2, ..., Sm be a collection of sets such that contains at least k elements for k = 1,2,...,m and for all k-combinations {} of the integers 1,2,...,m and suppose that each of these sets contains at least t elements. If tm then the collection has at least t ! SDRs, and if t > m then the collection has at least t ! / (t - m)! SDRs.

Relation to matching and covering

One can construct a bipartite graph in which the vertices on one side are the sets, the vertices on the other side are the elements, and the edges connect a set to the elements it contains. Then, a transversal (defined as a system of distinct representatives) is equivalent to a perfect matching in this graph.

One can construct a hypergraph in which the vertices are the elements, and the hyperedges are the sets. Then, a transversal (defined as a system of not-necessarily-distinct representatives) is a vertex cover in a hypergraph.


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. In this case, the "sets" (cosets) are mutually disjoint, i.e. the cosets form a partition of the group.

As a particular case of the previous example, given a direct product of groups , then H is a transversal for the cosets of K.

In general, since any equivalence relation on an arbitrary set gives rise to a partition, picking any representative from each equivalence class results in a transversal.

Another instance of a partition-based transversal occurs when one considers the equivalence relation known as the (set-theoretic) kernel of a function, defined for a function with domain X as the partition of the domain . which partitions the domain of f into equivalence classes such that all elements in a class map via f to the same value. If f is injective, there is only one transversal of . For a not-necessarily-injective f, fixing a transversal T of induces a one-to-one correspondence between T and the image of f, henceforth denoted by . Consequently, a function is well defined by the property that for all z in where x is the unique element in T such that ; furthermore, g can be extended (not necessarily in a unique manner) so that it is defined on the whole codomain of f by picking arbitrary values for g(z) when z is outside the image of f. It is a simple calculation to verify that g thus defined has the property that , which is the proof (when the domain and codomain of f are the same set) that the full transformation semigroup is a regular semigroup. acts as a (not necessarily unique) quasi-inverse for f; within semigroup theory this is simply called an inverse. Note however that for an arbitrary g with the aforementioned property the "dual" equation may not hold. However if we denote by , then f is a quasi-inverse of h, i.e. .

Common transversals

A common transversal of the collections A and B (where ) is a set that is a transversal of both A and B. The collections A and B have a common transversal if and only if, for all ,



A partial transversal is a set containing at most one element from each member of the collection, or (in the stricter form of the concept) a set with an injection from the set to C. The transversals of a finite collection C of finite sets form the basis sets of a matroid, the transversal matroid of C. The independent sets of the transversal matroid are the partial transversals of C.[9]

An independent transversal (also called a rainbow-independent set or independent system of representatives) is a transversal which is also an independent set of a given graph. To explain the difference in figurative terms, consider a faculty with m departments, where the faculty dean wants to construct a committee of m members, one member per department. Such a committee is a transversal. But now, suppose that some faculty members dislike each other and do not agree to sit in the committee together. In this case, the committee must be an independent transversal, where the underlying graph describes the "dislike" relations.[10]

Another generalization of the concept of a transversal would be a set that just has a non-empty intersection with each member of C. An example of the latter would be a Bernstein set, which is defined as a set that has a non-empty intersection with each set of C, but contains no set of C, where C is the collection of all perfect sets of a topological Polish space. As another example, let C consist of all the lines of a projective plane, then a blocking set in this plane is a set of points which intersects each line but contains no line.

Category theory

In the language of category theory, a transversal of a collection of mutually disjoint sets is a section of the quotient map induced by the collection.

Computational complexity

The computational complexity of computing all transversals of an input family of sets has been studied, in particular in the framework of enumeration algorithms.

See also


  1. ^ John Mackintosh Howie (1995). Fundamentals of Semigroup Theory. Clarendon Press. p. 63. ISBN 978-0-19-851194-6.
  2. ^ Clive Reis (2011). Abstract Algebra: An Introduction to Groups, Rings and Fields. World Scientific. p. 57. ISBN 978-981-4335-64-5.
  3. ^ Bruno Courcelle; Joost Engelfriet (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press. p. 95. ISBN 978-1-139-64400-6.
  4. ^ a b Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549
  5. ^ Roberts, Fred S.; Tesman, Barry (2009), Applied Combinatorics (2nd ed.), Boca Raton: CRC Press, ISBN 978-1-4200-9982-9
  6. ^ Brualdi, Richard A. (2010), Introductory Combinatorics (5th ed.), Upper Saddle River, NJ: Prentice Hall, ISBN 978-0-13-602040-0
  7. ^ Ryser, Herbert John (1963), Combinatorial Mathematics, The Carus Mathematical Monographs #14, Mathematical Association of America
  8. ^ E. C. Milner (1974), TRANSVERSAL THEORY, Proceedings of the international congress of mathematicians, p. 161
  9. ^ Oxley, James G. (2006), Matroid Theory, Oxford graduate texts in mathematics, vol. 3, Oxford University Press, p. 48, ISBN 978-0-19-920250-8.
  10. ^ Haxell, P. (2011-11-01). "On Forming Committees". The American Mathematical Monthly. 118 (9): 777–788. doi:10.4169/amer.math.monthly.118.09.777. ISSN 0002-9890. S2CID 27202372.

Further reading