Help


from Wikipedia
« »  
A transversal ( or " hitting set ") of a hypergraph H = ( X, E ) is a set that has nonempty intersection with every edge.
A transversal T is called minimal if no proper subset of T is a transversal.
The transversal hypergraph of H is the hypergraph ( X, F ) whose edge set F consists of all minimal transversals of H.

2.293 seconds.