Matching in Graphs. Let G be a graph. Two edges are independent if they have
no common endvertex. A set M of independent edges of G is called a matching.
..... How many couples at most can the federation form? Justify your answer.
Exercise 6.2. A managing director has to launch the marketing of a new product. 
