Transversal (combinatorics): Difference between revisions

Content deleted Content added
The axiom of choice is equivalent to the statement that every partition has a transversal.
Line 8:
 
In [[computer science]], computing transversals is useful in several application domains, with the input [[family of sets]] often being described as a [[hypergraph]].
 
In [[set theory]], the [[axiom of choice]] is equivalent to the statement that every [[partition of a set|partition]] has a transversal.<ref>{{cite web|url=https://plato.stanford.edu/entries/axiom-choice/|title=The Axiom of Choice|website=Stanford Encyclopedia of Philosophy|first=Bell|last=John|date=December 10, 2021|access-date=December 2, 2024|quote=Let us call Zermelo’s 1908 formulation the combinatorial axiom of choice: CAC: Any collection of mutually disjoint nonempty sets has a transversal.}}</ref>
 
==Existence and number==