Abstract
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 Chvátal 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.
Original language | English (US) |
---|---|
Journal | Electronic Journal of Combinatorics |
Volume | 22 |
Issue number | 1 |
DOIs | |
State | Published - Mar 23 2015 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics
Keywords
- Combinatorial geometry
- Extremal combinatorics
- Metric space