An extension of a result concerning convex geometric graphs

Details An extension of a result concerning convex geometric graphs An extension of a result concerning convex geometric graphs

2007-09-24

arxiv.org/abs/0709.3590v5

Computer Science

Discrete Mathematics

This paper has been withdrawn by the author. This paper was presented at Discrete Math Days in Fort Collins Colorado

Scientific paper

We show a general result known as the Erdos_Sos Conjecture: if
$E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of
order $k+1$ as a subgraph.

Affiliated with

Also associated with

No associations

Rating

An extension of a result concerning convex geometric 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 An extension of a result concerning convex geometric graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extension of a result concerning convex geometric graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276381