A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture

zbMath0889.52008MaRDI QIDQ1378536

Noga Alon, Daniel J. Kleitman

Publication date: 15 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119429

zbMATH Keywords

combinatorial proofHadwiger Debrunner \((p,q)\) conjecture

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35)

Related Items

Improved bounds on the Hadwiger-Debrunner numbers ⋮ From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem ⋮ Helly’s theorem: New variations and applications ⋮ From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem ⋮ A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane