An extension of a result concerning convex geometric graphs
Gilbert, Jesse
Original · EN
We show a general result known as the Erdosₛos 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.