The elements of any distributive lattice form a median graph, a structure in which any three elements formula_5, formula_4, and formula_19 (here, stable matchings) have a unique median element formula_105 that lies on a shortest path between any two of them.