A De Bruijn-Erdos theorem for chordal graphs

Details A De Bruijn-Erdos theorem for chordal graphs A De Bruijn-Erdos theorem for chordal graphs

2012-01-30

arxiv.org/abs/1201.6376v1

Mathematics

Combinatorics

Scientific paper

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
in all metric spaces induced by connected chordal graphs.

Affiliated with

Also associated with

No associations

Rating

A De Bruijn-Erdos theorem for chordal graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A De Bruijn-Erdos theorem for chordal graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A De Bruijn-Erdos theorem for chordal graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56186