Practice Modeling Job Assignments With Matching (25.1.2) - Introduction to Bipartite Graphs and Matching

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a bipartite graph?
Show hintHide hint
Remember the term 'bi' means two.
Question 2.
Define matching.
Show hintHide hint
Think about connections without overlap.
3Question 3.
What defines a bipartite graph?
- True
- False
Show hintHide hint
Recall the definition features two groups.
4Question 4.
A maximum matching can be larger than a maximal matching.
- True
- False
Show hintHide hint
Think about how many edges each can have.
Question 5.
In a bipartite graph with employees A, B, and C, and modules 1, 2, and 3, if A can do modules 1 & 2, B can do 2 & 3, and C can do 1 & 3, illustrate if a complete matching exists.
Show hintHide hint
Review potential overlaps in assignments.
Question 6.
Create an example of a bipartite graph that demonstrates Hall's theorem failing to hold.
Show hintHide hint
Count neighbors of the subset you select.

5 more questions in this section. Enroll free to practise them all.