Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
