The binomial edge ideal associated to a graph G is the quadratic binomial ideal generated by the set containinig xv*yw-xw-yv for every edge (v,w) in G. This method returns the binomial edge ideal I of a random graph G which has n vertices and t edges.
i1 : randomBinomialEdgeIdeal(7, 4)
o1 = (ideal (- x y + x y , - x y + x y , x y - x y , x y - x y ),
2 6 6 2 2 5 5 2 6 7 7 6 1 3 3 1
------------------------------------------------------------------------
Graph{edges => {{x , x }, {x , x }, {x , x }, {x , x }}})
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
o1 : Sequence
|