The binomial edge ideal associated to a graph G is the quadratic binomial ideal generated by the set containinig x_v*y_w-x_w-y_v 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 ), Graph{edges => {{x , x }, {x , x }, {x , x }, {x , x }}})
3 4 4 3 3 5 5 3 4 1 1 4 6 7 7 6 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
o1 : Sequence
|
The object randomBinomialEdgeIdeal is a method function.