The stable admissions polytope - the convex hull of the stable assignments
of the university admissions problem - is described by a set of linear ineq
ualities. It depends on a new characterization of stability and arguments t
hat exploit and extend a graphical approach that has been fruitful in the a
nalysis of the stable marriage problem.