2. Let G be a bipartite graph with 10^7 left vertices and 20
right vertices. Two vertices u, v are called twins if the set of
neighbors of u equals the set of neighbors of v (triplets,
quadruplets etc are defined similarly). Show that G has twins. Show
that G has triplets. What about quadruplets, etc.?
3. Show that there exists a bipartite graph with 10^5 left
vertices and 20 right vertices without any twins.
4. Show that any graph...