The Erd\"os-S\'os Conjecture for Spiders
Abstract
The Erd\"os-S\'os conjecture states that if G is a graph with average degree more than k-1, then G contains every tree of k edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that Erd\"os-S\'os conjecture holds for all spiders.
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.