The edge polytope of a finite graph is the convex hull of the columns of its unsigned incidence matrix. I'will present a paper of Ohsugi and Hibi classifying graphs whose edge polytopes are simple.