The Graph of Monomial Ideals

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes representing) edges in this graph. We study the induced subgraphs on multigraded Hilbert schemes and on square-free monomial ideals. In the latter case, the edges correspond to generalized bistellar flips.