Discrete Helly-type theorems for pseudohalfplanes

03/20/2021
by   Balázs Keszegh, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2020

Intersection theorems for triangles

Given a family of sets on the plane, we say that the family is intersect...
research
02/15/2022

A new discrete theory of pseudoconvexity

Recently geometric hypergraphs that can be defined by intersections of p...
research
07/20/2017

Pictures of Combinatorial Cubes

We prove that the 8-point algorithm always fails to reconstruct a unique...
research
06/28/2018

Recovering Trees with Convex Clustering

Convex clustering refers, for given {x_1, ..., x_n}⊂^p, to the minimizat...
research
01/14/2020

Critical Sets of PL and Discrete Morse Theory: a Correspondence

Piecewise-linear (PL) Morse theory and discrete Morse theory are used in...
research
08/01/2018

Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns

Tverberg's theorem says that a set with sufficiently many points in R^d ...
research
09/06/2019

Incompleteness Ex Machina

In this essay we'll prove Gödel's incompleteness theorems twice. First, ...

Please sign up or login with your details

Forgot password? Click here to reset