Matchings · Independent Sets and Covers
Lesson 2
Problem. Find \(\alpha(G)\), i.e., the maximum size of a vertex-independent set in the graph \(G\) shown below.
5 points
Matchings · Independent Sets and Covers
Problem. Find \(\alpha(G)\), i.e., the maximum size of a vertex-independent set in the graph \(G\) shown below.