Let G(D) be the set of all graphs with degree sequence d. The Erdos-Gallai conditions give the necessary and sufficient conditions for the existence of a graph with degree sequence d. If G(D) is nonempty, how do we approximate the size of all such graphs? I will discuss a maximum entropy approach to this problem. It involves considering G(D) as the set of integer points of a certain polytope in R^(n choose 2) and constructing a probability distribution that is constant on this set of points. Using a concentration result, we can use this distribution to approximate the size of G(D).