Practice Definition Of Matching (25.1.3) - Introduction to Bipartite Graphs and Matching

Practise this section

9 questions

Flashcard drill
3 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.
Define a bipartite graph.
Show hintHide hint
Think about how the groups are structured.
Question 2.
What is a maximum matching?
Show hintHide hint
Consider which matching has the most connections.
3Question 3.
What defines a maximum matching?
- It has the fewest edges
- It has more edges than maximal matching
- It has the largest number of edges
Show hintHide hint
Think about which matching allows the most connections.
4Question 4.
True or False: In a maximal matching, you can add more edges without losing its properties.
- True
- False
Show hintHide hint
What happens if you try to add edges?
Question 5.
Given a bipartite graph with 4 tasks and 3 employees, can you find a complete matching? Justify your answer.
Show hintHide hint
Count how many tasks can be paired with available employees.
Question 6.
Create a scenario with three students and three projects where not all students are assigned a project. Analyze if a maximal matching exists.
Show hintHide hint
Consider how edges connect.

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