Macaulay2 » Documentation
Packages » Graphs :: edgeIdeal
next | previous | forward | backward | up | index | toc

edgeIdeal -- returns the edge ideal of a graph

Synopsis

Description

The edge ideal of a graph G is the ideal generated by the minimal nonfaces of the independence complex of G.

i1 : G = graph({{1, 2}, {1, 3}, {2, 3}, {3, 4}},EntryMode=>"edges");
i2 : edgeIdeal G

o2 = monomialIdeal (x x , x x , x x , x x )
                     1 2   1 3   2 3   3 4

o2 : MonomialIdeal of QQ[x ..x ]
                          1   4

See also

Ways to use edgeIdeal :

For the programmer

The object edgeIdeal is a method function.