>
|
|
| (1) |
Create a hypergraph from its vertices and edges.
>
|
|
| (2) |
Print the vertices and edges of H.
>
|
|
| |
| (3) |
Draw a graphical representation of this hypergraph.
Compute Max(H), print its vertices and edges, draw a graphical representation of it.
>
|
|
| |
| |
| |
Compute Min(H), print its vertices and edges, draw a graphical representation of it.
>
|
|
| |
| |
| |
Compute the transversal hypergraph of H.
>
|
|
| |
| |
| |
Observe that Transversal(T) and Min(H) are equal.
>
|
|
| |
| |
Consider the following Kuratowski hypergraph.
>
|
|
| (5) |
Observe that K3 is its own transversal.
>
|
|
Consider a random hypergraph on 5 points and 15 hyperedges.
>
|
|
| |
| (7) |
Compute its minimal hyperedges.
>
|
|
| |
| (8) |
Compute the transversal hypergraph T of R and the transversal hypergraph TT of T.
>
|
|
| |
| (9) |
>
|
|
| |
| (10) |
Observe that TT and M are equal.