This class represents hypergraphs. A hypergraph is a tuple (V,E) of vertices V and edges E which are subsets of the vertices. In this package, all hypergraphs have the additional property that no edge is a subset of any other edge. Hypergraphs of this form are often referred to as clutters.
i1 : R = QQ[w,x,y,z]; |
i2 : H = hyperGraph(R, {{w,x},{w,y,z},{x,y,z}});
|
i3 : vertices H
o3 = {w, x, y, z}
o3 : List
|
i4 : edges H
o4 = {{w, x}, {w, y, z}, {x, y, z}}
o4 : List
|
i5 : ring H o5 = R o5 : PolynomialRing |
Hypergraphs are always associated with a polynomial ring whose variables are the vertices of the hypergraph.
The object HyperGraph is a type, with ancestor classes HashTable < Thing.