On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers

Let HDd(p, q) denote the minimal size of a transversal that can always be guaranteed for a family of compact convex sets in ℝd which satisfy the (p, q)-property (p ≥ q ≥ d + 1). In a celebrated proof of the Hadwiger-Debrunner conjecture, Alon and Kleitman proved that HDd(p, q) exists for all p ≥ q ≥ d + 1. Specifically, they prove that HDd(p, d + 1) is O(pd2+d). This paper has two parts. In the first part we present several improved bounds on HDd(p, q). In particular, we obtain the first near tight estimate of HDd(p, q) for an extended range of values of (p, q) since the 1957 Hadwiger-Debrunner theorem. In the second part we prove a (p, 2)-theorem for families in ℝ2 with union complexity below a specific quadratic bound. Based on this, we introduce a polynomial time constant factor approximation algorithm for MAX-CLIQUE of intersection graphs of convex sets satisfying this property. It is not likely that our constant factor approximation can be improved to a PTAS as MAX-CLIQUE for intersection graphs of fat ellipses is known to be APX-HARD and fat ellipses have sub-quadratic union complexity.

[1]  János Pach,et al.  On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves , 2014, SODA.

[2]  Rom Pinchasi.  A Note on Smaller Fractional Helly Numbers , 2015, Discret. Comput. Geom..

[3]  Ferenc Fodor,et al.  Colourful and Fractional (p,q)-theorems , 2014, Discret. Comput. Geom..

[4]  Saurabh Ray,et al.  New existence proofs ε-nets , 2008, SCG '08.

[5]  Christoph Ambühl,et al.  The Clique Problem in Intersection Graphs of Ellipses and Triangles , 2005, Theory of Computing Systems.

[6]  Noga Alon,et al.  A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture , 1997, Electron. J. Comb..

[7]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[8]  Jirí Matousek,et al.  New Constructions of Weak ε-Nets , 2004, Discret. Comput. Geom..

[9]  Noga Alon,et al.  A Simple Proof of the Upper Bound Theorem , 1985, Eur. J. Comb..

[10]  Jürgen Eckhoff,et al.  An Upper-Bound theorem for families of convex sets , 1985 .

[11]  M. Katchalski,et al.  A problem of geometry in ⁿ , 1979 .

[12]  Timothy M. Chan,et al.  Approximation Algorithms for Maximum Independent Set of Pseudo-Disks , 2012, Discret. Comput. Geom..

[13]  Gabriel Nivasch,et al.  A Variant of the Hadwiger–Debrunner (p, q)-Problem in the Plane , 2015, Discret. Comput. Geom..

[14]  Noga Alon,et al.  Transversal numbers for hypergraphs arising in geometry , 2002, Adv. Appl. Math..

[15]  H. Hadwiger,et al.  Über eine Variante zum Hellyschen Satz , 1957 .

[16]  Jirí Matousek,et al.  Bounded VC-Dimension Implies a Fractional Helly Theorem , 2004, Discret. Comput. Geom..

[17]  H. Edelsbrunner,et al.  Improved bounds on weak ε-nets for convex sets , 1995, Discret. Comput. Geom..

[18]  Gil Kalai,et al.  Intersection patterns of convex sets , 1984 .

[19]  Géza Tóth,et al.  Convex Sets in the Plane with Three of Every Four Meeting , 2001, Comb..

[20]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[21]  N. Alon,et al.  Piercing convex sets and the hadwiger-debrunner (p , 1992 .

[22]  M. Sharir,et al.  State of the Union (of geometric objects) , 2008 .