The Erd\"os-S\'os Conjecture for Spiders

arXiv1804.06567MaRDI QIDQ6300501FDOQ6300501

Genghua Fan, Qinghai Liu, Yanmei Hong

Publication date: 18 April 2018

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.

This page was built for publication: The Erd\"os-S\'os Conjecture for Spiders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300501)