Realizing an m-uniform four-chromatic hypergraph with disks

11/24/2020
by   Gábor Damásdi, et al.
0

We prove that for every m there is a finite point set 𝒫 in the plane such that no matter how 𝒫 is three-colored, there is always a disk containing exactly m points, all of the same color. This improves a result of Pach, Tardos and Tóth who proved the same for two colors. The main ingredient of the construction is a subconstruction whose points are in convex position. Namely, we show that for every m there is a finite point set 𝒫 in the plane in convex position such that no matter how 𝒫 is two-colored, there is always a disk containing exactly m points, all of the same color. We also prove that for unit disks no similar construction can work, and several other results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2022

Erdős–Szekeres-type problems in the real projective plane

We consider point sets in the real projective plane ℝP^2 and explore var...
research
11/11/2022

Peeling Sequences

Given an n-element point set in the plane, in how many ways can it be pe...
research
06/28/2018

Recovering Trees with Convex Clustering

Convex clustering refers, for given {x_1, ..., x_n}⊂^p, to the minimizat...
research
12/03/2021

Three-chromatic geometric hypergraphs

We prove that for any planar convex body C there is a positive integer m...
research
05/31/2020

Conditional Logic is Complete for Convexity in the Plane

We prove completeness of preferential conditional logic with respect to ...
research
07/21/2020

A family of non-periodic tilings of the plane by right golden triangles

We consider tilings of the plane by two prototiles which are right trian...
research
07/15/2020

Empty Rainbow Triangles in k-colored Point Sets

Let S be a set of n points in general position in the plane. Suppose tha...

Please sign up or login with your details

Forgot password? Click here to reset