Revision as of 15:11, 22 April 2021 edit Erel Segal (talk \| contribs) Extended confirmed users, IP block exemptions 14,576 edits →Relation to matching and covering Tag: Visual edit ← Previous edit		Revision as of 15:36, 22 April 2021 edit undo Erel Segal (talk \| contribs) Extended confirmed users, IP block exemptions 14,576 edits →Relation to matching and covering Tag: Visual edit Next edit →
Line 20: 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 ~~equivalent to~~ a [[Vertex cover in hypergraphs\|'''vertex cover''' in a hypergraph]]. ==Examples==

Transversal (combinatorics): Difference between revisions