The Electronic Journal of Combinatorics · 2015 · 20 citations · 8 references
Natural SciencesComputer ScienceMathematicsDiscrete MathematicsGeometryTopologyDiscrete GeometryGeometric GraphsGraph TheoryMetric GeometryPoint-line Configurations
A special case of a combinatorial theorem of De Bruijn and Erdős asserts that every noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chávtal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces induced by connected chordal graphs.
8
G. M. Petersen, H. S. M. Coxeter · American Mathematical Monthly · 1961 · 548 citations
T H O‘Beirne · Physics Bulletin · 1962 · 475 citations
FA Dick de Bruijn, P. Erdös · 1948 · 406 citations
Sylvester?Gallai Theorem and Metric Betweenness
Vasek Chv�tal · Discrete & Computational Geometry · 2004 · 46 citations · Full text