Let G be a connected hypergraph. We give a min–max relation for the minimum number of edges that are required to increase the connectivity by 1. We also show that the corresponding algorithmic problem can be solved in polynomial time.
