Wegner's Piercing Conjecture for Rectangles
Statement
Wegner conjectured in 1965 that every finite family of axis-parallel rectangles satisfies , where is the minimum number of piercing points and the largest pairwise-disjoint subfamily. False, by an explicit triangle-free counterexample.
Record
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
construction · #1
Deepak Ajwani, Rishikesh Gajjala and Rajiv Raman, using GPT-5.5 Pro, CodexThat credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
The authors say the construction of the initial counterexamples relied heavily on trial and error, and that GPT-5.5 Pro was used extensively to search for suitable constructions. Codex drew the figures and drafted portions of the text. They note the correctness of the proofs does not rest on the auxiliary machine verifications.
Recorded elsewhere on #1 · not checked here
recorded: correctVibeMathed site checkscope Reproduction by the VibeMathed site
The refutation is an explicit finite family of rectangles, so it reduces to a finite piercing computation. arXiv preprint, not peer-reviewed.
Repeated from the source; nothing was checked here.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.