There are several standard constructions of hypergraphs in the literature. This package provides some of them.

For every positive integer r, the hypergraphs Fan(r) and Lovasz(r) are auto-transversal, that is, each of them is its own transversal hypergraph.

In addition, the hypergraph Fan(r) is self-dual, that is, it is isomorphic to its dual hypergraph.

The hypergraphs Kuratowski(S,r) have predictable transversal and dual hypergraphs.

The hypergraph NonEmptyPowerSet(S) can be used to build new hypergraphs by applying the PartialHypergraph and SubHypergraph commands.

The command RandomHypergraph provides a way to create new test hypergraphs.

Claude Berge. Hypergraphes. Combinatoires des ensembles finis. 1987, Paris, Gauthier-Villars, translated to English.

Claude Berge. Hypergraphs. Combinatorics of Finite Sets. 1989, Amsterdam, North-Holland Mathematical Library, Elsevier, translated from French.