recently Pari Arya research NPHard problem find minimum vertex cover problem interestingsuppose graph g give Subset a vertex call vertex cover graph edge uv endpoint set ie bothpari Arya win great undirected graph award team contest now split part want part graph vertex coverthey agree graph need find disjoint subset vertex a B A b vertex cover claim impossible each vertex give friend