Ask a Question

Prefer a chat interface with context about you and your work?

A De Bruijn–Erdős theorem for chordal graphs

A De Bruijn–Erdős theorem for chordal graphs

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization …