An extension of a result concerning convex geometric graphs
Abstract
We show a general result known as the ErdosSos 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.