The edge ideal of a graph is the quadratic monomial ideal generated by xv*xw for all edges (v,w) in the graph. This method returns the edge ideal I of a random graph G which has n vertices and t edges.
i1 : randomEdgeIdeal(7, 4)
o1 = (Graph{edges => {{x , x }, {x , x }, {x , x }, {x , x }}}, monomialIdeal
2 6 1 3 6 7 2 5
ring => QQ[x , x , x , x , x , x , x ]
1 2 3 4 5 6 7
vertices => {x , x , x , x , x , x , x }
1 2 3 4 5 6 7
------------------------------------------------------------------------
(x x , x x , x x , x x ))
1 3 2 5 2 6 6 7
o1 : Sequence
|