Explore tens of thousands of sets crafted by our community.
Hall's Marriage Theorem
8
Flashcards
0/8
Bipartite graph with every left vertex connected to exactly two right vertices
Existence of a perfect matching
A team-based bipartite graph where each team needs to pick a unique meeting room, but some rooms are too small for certain teams
Existence of a perfect matching
A bipartite graph where left vertices are tasks and right vertices are workers, each task can be done by at least one worker
Existence of a perfect matching
Matching courses to students in a bipartite graph where every course is liked by at least one student
Existence of a perfect matching
A bipartite graph with left vertices representing students and right vertices representing desks, where each student likes exactly 3 desks
Existence of a perfect matching
Family gathering scenario modeled as a bipartite graph with members and seats, where each member has a list of preferred seats
Existence of a perfect matching
A bipartite graph where each right vertex has a degree of 1
Existence of a perfect matching
Bipartite graph representing job assignments with all jobs requiring a unique skill
Existence of a perfect matching
© Hypatia.Tech. 2024 All rights reserved.