Problem
COM-B2-M08-P001 A Star and a Matching
#1
★★☆☆☆ Level 2 of 5
In the star \(K_{1,n}\), find the largest possible size of a matching.
All edges share one endpoint.
Any two edges of the star share the centre, so a matching cannot contain two edges. One edge can be chosen. The answer is \(1\).
A check of the definition.