H = hyperGraph(R,E)
H = hyperGraph(I)
H = hyperGraph(J)
H = hyperGraph(E)
H = hyperGraph(G)
The function hyperGraph is a constructor for HyperGraph. The user can input a hypergraph in a number of different ways, which we describe below. The information describing the hypergraph is stored in a hash table. We require that there be no inclusion relations between the edges of a hypergraph; that is, that it be a clutter. The reason is that this package is designed for edge ideals, which would lose any information about edges that are supersets of other edges.
For the first possibility, the user inputs a polynomial ring, which specifies the vertices of graph, and a list of the edges of the graph. The edges are represented as lists.



Alternatively, if the polynomial ring has already been defined, it suffices simply to enter the list of the edges.





The list of edges could also be entered as a list of squarefree monomials.



Another option for defining an hypergraph is to use an ideal or monomialIdeal.





From any graph we can make a hypergraph with the same edges.



Not all hypergraph constructors are able to make the empty hypergraph, that is, the hypergraph with no edges. Specifically, the constructors that take only a list cannot make the empty hypergraph because the underlying ring is not given. To define the empty hypergraph, give an explicit polynomial ring or give the (monomial) ideal.




The object hyperGraph is a method function.