From a (p, 2)-Theorem to a Tight (p, q)-Theorem

Chaya Keller, Shakhar Smorodinsky

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

תקציר

A family F of sets is said to satisfy the (p, q)-property if among any p sets of F some q have a nonempty intersection. The celebrated (p, q)-theorem of Alon and Kleitman asserts that any family of compact convex sets in ℝd that satisfies the (p, q)-property for some q ≥ d + 1, can be pierced by a fixed number (independent on the size of the family) fd(p, q) of points. The minimum such piercing number is denoted by HDd(p, q). Already in 1957, Hadwiger and Debrunner showed that whenever q > d-1/d p + 1 the piercing number is HDd(p, q) = p - q + 1; no exact values of HDd(p, q) were found ever since. While for an arbitrary family of compact convex sets in ℝd, d ≥ 2, a (p, 2)-property does not imply a bounded piercing number, such bounds were proved for numerous specific families. The best-studied among them is axis-parallel boxes in ℝd, and specifically, axis-parallel rectangles in the plane. Wegner (1965) and (independently) Dol'nikov (1972) used a (p, 2)-theorem for axis-parallel rectangles to show that HDrect(p, q) = p - q + 1 holds for all q > √2p. These are the only values of q for which HDrect(p, q) is known exactly. In this paper we present a general method which allows using a (p, 2)-theorem as a bootstrapping to obtain a tight (p, q)-theorem, for families with Helly number 2, even without assuming that the sets in the family are convex or compact. To demonstrate the strength of this method, we show that HDd-box(p, q) = p - q + 1 holds for all q > c'logd-1 p, and in particular, HDrect(p, q) = p - q + 1 holds for all q ≥ 7 log2 p (compared to q ≥ √2p, obtained by Wegner and Dol'nikov more than 40 years ago). In addition, for several classes of families, we present improved (p, 2)-theorems, some of which can be used as a bootstrapping to obtain tight (p, q)-theorems. In particular, we show that any family F of compact convex sets in ℝd with Helly number 2 admits a (p, 2)-theorem with piercing number O(p2d-1), and thus, satisfies HDF(p, q) = p - q + 1 for all q > cp1-1/2d-1, for a universal constant c.

שפה מקוריתאנגלית
כותר פרסום המארח34th International Symposium on Computational Geometry, SoCG 2018
עורכיםCsaba D. Toth, Bettina Speckmann
מוציא לאורSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
עמודים511-5114
מספר עמודים4604
מסת"ב (אלקטרוני)9783959770668
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 1 יוני 2018
אירוע34th International Symposium on Computational Geometry, SoCG 2018 - Budapest, הונגריה
משך הזמן: 11 יוני 201814 יוני 2018

סדרות פרסומים

שםLeibniz International Proceedings in Informatics, LIPIcs
כרך99

כנס

כנס34th International Symposium on Computational Geometry, SoCG 2018
מדינה/אזורהונגריה
עירBudapest
תקופה11/06/1814/06/18

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'From a (p, 2)-Theorem to a Tight (p, q)-Theorem'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי