Jason Cong

Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates

We study the maximum strong independent set problem in a finite hypergraph: find the largest vertex set that intersects every hyperedge in at most one vertex. This objective arises whenever each observed block is a local incompatibility constraint but transitive closure across overlapping blocks is not justified. A mot...