This page is under construction… More content will be added later.
For a basic definition of what a stable matching is, see Wikipedia.
The set of stable matchings has a nice combinatorial structure. To learn more about it, I recommend this awesome book written by Gusfield and Irving.
To see what the lattice of stable matchings looks like on small examples, have a look at the following animations:
The code used to generate those animations is available on GitHub.