Minimum Vertex Cover, referring to the drawings, edges, points covering at least the few that can meet all of the edges have to be covered with at least one endpoint.
Maximum independent set, refers to a maximum point set not satisfy the set of two arbitrary edge.
Conclusion 1: Minimum Vertex Cover = Maximum Matching
Why minimum coverage equal to the maximum match it? First, it must be a point of maximum matching covers (not said to be the minimum), because the maximum number of unique match is the greatest match bipartite graph line between two points, if an exact match result Obviously, if not completely match, there are some points isolated, isolated because of their other endpoint side is occupied by the other match, indicating that the other endpoint included in the match, then cover the repeated point can cover more points, all repeat points are covered again, you get all of the endpoint side. (For example, no two ends of one side of the other side are connected, so the more out augmenting path, corresponds to the maximum match is not seeking the largest, measures seeking the)
Conclusion 2: maximum independent set = total number of points - Maximum Matching
Maximum independent set, is equivalent to the minimum point is removed, so that there is no edge between the remaining points, equivalent to the minimum point cover is removed (minimum points cover all sides), so that the total number of points - minimum coverage points = total - the biggest match
