The toric edge ideal of a graph G is the kernel of the map from the polynomial ring k[edges(G)] to the polynomial ring k[vertices G] taking an x_e to y_i*y_j, where e = (i,j). This method returns the toric edge ideal I of a random graph G which has n vertices and t edges. I is the kernel of the homomorphism from QQ[x_1..x_n] to QQ/101[e_1..e_t] which sends each vertex in the graph G to the product of its endpoints.
|
Note that his is different than the randomBinomialEdgeIdeal!
|
The object randomToricEdgeIdeal is a method function.