Abstract
Claude Berge has given sufficient conditions under which each edge of a regular multigraph belongs to some 1-factor. His proof-technique actually yields the same conclusion under less restrictive conditions. Here we point out that this stronger version of Berge's theorem follows easily from a theorem on doubly-stochastic matrices proved previously by the author.
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.
