# randomEdgeIdeal -- Creates an edge ideal from a random graph with n vertices and t edges.

## Synopsis

• Usage:
(I,G) = randomEdgeIdeal(n,t)
• Inputs:
• Outputs:
• I, an ideal, a random edge ideal
• G, , the graph underlying I

## Description

The edge ideal of a graph is the quadratic monomial ideal generated by x_v*x_w 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 3 4 1 4 6 7 3 5 ring => QQ[x ..x ] 1 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 4 3 4 3 5 6 7 o1 : Sequence