Unbiased Version of Hall's Marriage Theorem in Matrix Form

Abstrakt

Inspired by an old result by Georg Frobenius, we show that the unbiased version of Hall's marriage theorem is more transparent when reformulated in the language of matrices. At the same time, we obtain a more general statement applicable to bipartite graphs whose parts need not have the same size.

Klíčová slova

• Hall's marriage theorem
• bipartite graph