Matchings · Independent Sets and Covers

Lesson 4

Nikolai Chukhin · Alexander S. Kulikov

Problem. Find \(\alpha'(G)\), i.e., the maximum size of a matching (edge-independent set) in the graph \(G\) shown below.

5 points