Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Hall's marriage theorem

A bipartite graph has a matching saturating one side exactly when every subset's neighborhood is large enough.

Hall's marriage theorem is the fact that a matching saturating $L$ exists exactly when $|N(S)|\ge|S|$ for every subset $S\subseteq L$ .