Discrete Helly-type theorems for pseudohalfplanes

Keszegh, Balázs (2022) Discrete Helly-type theorems for pseudohalfplanes. EUROPEAN JOURNAL OF COMBINATORICS, 101. ISSN 0195-6698

Preview

Text 1-s2.0-S0195669821001633-main.pdf Available under License Creative Commons Attribution. Download (497kB) | Preview

Abstract

We prove discrete Helly-type theorems for pseudohalfplanes, which extend recent results of Jensen, Joshi and Ray about halfplanes. Among others we show that given a family of pseudohalfplanes H and a set of points P, if every triple of pseudohalfplanes has a common point in P then there exists a set of at most two points that hits every pseudohalfplane of H. We also prove that if every triple of points of P is contained in a pseudohalfplane of H then there are two pseudohalfplanes of H that cover all points of P. To prove our results we regard pseudohalfplane hypergraphs, define their extremal vertices and show that these behave in many ways as points on the boundary of the convex hull of a set of points. Our methods are purely combinatorial. In addition we determine the maximal possible chromatic number of the regarded hypergraph families. © 2021 The Author(s)

Actions (login required)

Edit Item