A De Bruijn–Erdős theorem for chordal graphs
Résumé
A special case of a combinatorial theorem of De Bruijn and Erd˝ os 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.
Domaines
Mathématiques [math]| Origine | Publication financée par une institution |
|---|
Loading...
