Intersection theorems for triangles

09/30/2020
by   Peter Frankl, et al.
0

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In particular, we show that if a set P of n points is in convex position, then the largest intersecting family of triangles with vertices in P contains at most (1/4+o(1))n3 triangles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2018

Almost all string graphs are intersection graphs of plane convex sets

A string graph is the intersection graph of a family of continuous arcs...
research
06/30/2017

More Turán-Type Theorems for Triangles in Convex Point Sets

We study the following family of problems: Given a set of n points in co...
research
03/20/2021

Discrete Helly-type theorems for pseudohalfplanes

We prove discrete Helly-type theorems for pseudohalfplanes, which extend...
research
04/18/2020

Intersection theorems for (-1,0,1)-vectors

In this paper, we investigate Erdős–Ko–Rado type theorems for families o...
research
12/09/2019

Algebraic k-sets and generally neighborly embeddings

Given a set S of n points in R^d, a k-set is a subset of k points of S t...
research
09/18/2017

A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane

In this paper, a novel technique for tight outer-approximation of the in...
research
12/28/2022

Heterochromatic Higher Order Transversals for Convex Sets

In this short paper, we show that if {ℱ_n}_n ∈ℕ be a collection of famil...

Please sign up or login with your details

Forgot password? Click here to reset