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

Synopsis

• Usage:

  (I,G) = randomEdgeIdeal(n,t)

• Inputs:
  • n, an integer, number of vertices
  • t, an integer, number of edges
• Outputs:
  • I, an ideal, a random edge ideal
  • G, a graph, the graph underlying I

Description

i1 : randomEdgeIdeal(7, 4)

o1 = (Graph{"edges" => {{x , x }, {x , x }, {x , x }, {x , x }}},
                          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
     ------------------------------------------------------------------------
     monomialIdeal (x x , x x , x x , x x ))
                     1 4   3 4   3 5   6 7

o1 : Sequence

See also

• randomGraph -- returns a random graph
• edgeIdeal -- creates the edge ideal of a (hyper)graph