Hitting all Maximal Independent Sets of a Bipartite Graph

Abstract

We prove that given a bipartite graph G with vertex set V and an integer k, deciding whether there exists a subset of V of size k hitting all maximal independent sets of G is complete for the class Sigma_2^P.

v3: minor change