We compute the Betti numbers for all the powers of initial and final
lexsegment edge ideals. For the powers of the edge ideal of an anti-$d-$path,
we prove that they have linear quotients and we characterize the normally
torsion-free ideals. We determine a class of non-squarefree ideals, arising
from some particular graphs, which are normally torsion-free.
We study polytopes that are convex hulls of vectors of subgraph densities.
Many graph theoretical questions can be expressed in terms of these polytopes,
and statisticians use them to understand exponential random graph models.
Relations among their Ehrhart polynomials are described, their duals are
applied to certify that polynomials are non-negative, and we find some of their
faces.
In this paper we introduce the ideals of graph homomorphisms.
They are natural generalizations of toric ideals from algebraic statistics
studied by Diaconis, Sturmfels, and Sullivant. They are toric ideals; and their
polytopes, for example the stable set polytope, are important in optimization
theory. They capture more information about graphs than just the graphs, since
we work with the category of graph homomorphisms.