Revision as of 07:40, 25 October 2020 edit FrescoBot (talk \| contribs) Bots 1,152,845 edits m Bot: link syntax ← Previous edit		Revision as of 01:57, 28 February 2021 edit undo FrescoBot (talk \| contribs) Bots 1,152,845 edits m Bot: link syntax Next edit →
Line 17: == 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 is equivalent to a ~~[[Perfect matching\|~~'''[[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 is equivalent to a [[Vertex cover in hypergraphs\|'''vertex cover''' in a hypergraph]].

Transversal (combinatorics): Difference between revisions