pith. sign in

arxiv: 1207.3688 · v1 · pith:BEEG2BMBnew · submitted 2012-07-16 · 🧮 math.CO

Towards a de Bruijn-ErdH os theorem in the L₁-metric

classification 🧮 math.CO
keywords pointslinesleastmetriccontainsdistincteitherinduces
0
0 comments X
read the original abstract

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite metric spaces, with lines defined using the notion of {\em betweenness}. In this paper, we prove that the answer is affirmative for sets of $n$ points in the plane with the $L_1$ metric, provided that no two points share their $x$- or $y$-coordinate. In this case, either there is a line that contains all $n$ points, or $X$ induces at least $n$ distinct lines. If points of $X$ are allowed to share their coordinates, then either there is a line that contains all $n$ points, or $X$ induces at least $n/37$ distinct lines.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.