A Counterexample to Wegner's Conjecture for Axis-Parallel Rectangles
Resolves a long-standing open conjecture in combinatorial geometry, showing that the integrality gap for the Maximum Independent Set of Rectangles problem is at least 2.21.
The paper disproves Wegner's conjecture that for any finite family of axis-parallel rectangles, the piercing number is at most twice the packing number minus one, by constructing an explicit counterexample where the piercing number is at least twice the packing number, and a stronger construction achieving a ratio of 2.21.
In 1965, Wegner conjectured that every finite family \(\mathcal R\) of axis-parallel rectangles in the plane satisfies \(τ(\mathcal R) \le 2ν(\mathcal R)-1\), where \(τ(\mathcal R)\) denotes the minimum number of points needed to pierce all rectangles in \(\mathcal R\), and \(ν(\mathcal R)\) denotes the maximum size of a pairwise disjoint subfamily. Over the last six decades, the conjecture has motivated a long line of work: it has been verified for several special classes of rectangle families, and the best known general upper bounds have been progressively improved, but the conjecture itself had remained open. We give an explicit counterexample. More precisely, we construct a triangle-free rectangle-intersection graph on \(n\) vertices whose independence number is at most \(n/4\). Since the graph is triangle-free, no point of the plane can lie in three rectangles; hence every piercing point hits at most two rectangles. Consequently, \(τ(\mathcal R) \ge n/2 \ge 2ν(\mathcal R)\), contradicting Wegner's conjectured bound. We also give a slightly more general construction for which \(τ(\mathcal R) \ge 2.21ν(\mathcal R)\). This shows that the standard point relaxation, equivalently the clique relaxation, for the Maximum Independent Set of Rectangles problem has integrality gap at least \(2.21\).