We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as newly-defined polytopes whose vertices correspond to noncrossing set partitions. In analogy with matroid basis polytopes, the second class is obtained by considering the stable sets of maximal cardinality. We investigate how the class of $0/1$-polytopes whose edges satisfy our characterization is situated within the hierarchy of $0/1$-polytopes. This includes the class of matroid polytopes. We also study the diameter of these classes of polytopes and improve slightly on the Hirsch bound.
Download